Asslam-O-Alaikum
Friends
90% MCQ'S from past paper.
Q# Lec#22 Application of incrementing.( ka function btana tha) [2 marks]
Q# Recursive definition. [2 marks ]
Q#If there is no initial state in FA then that FA does not accept any language Discuss two situations when an FA does not accept any string not even the null string? [5 marks]
Ans in lecture #6 (page 15,16 )
Q#Give the transition table (FA yaad nai kaise tha) [3 marks]
Q# Consider a part of the following TG To eliminate state 3 the above TG can be reduced to. lecture #11 (page #28) 2nd example (r1,r2....r9) [ 5 marks]
Q # Consider the following Moore machine... (output btane the) lecture # 22
(page # 61) ki 1st example.[3 marks]
Friends
90% MCQ'S from past paper.
Q# Lec#22 Application of incrementing.( ka function btana tha) [2 marks]
Q# Recursive definition. [2 marks ]
Q#If there is no initial state in FA then that FA does not accept any language Discuss two situations when an FA does not accept any string not even the null string? [5 marks]
Ans in lecture #6 (page 15,16 )
Q#Give the transition table (FA yaad nai kaise tha) [3 marks]
Q# Consider a part of the following TG To eliminate state 3 the above TG can be reduced to. lecture #11 (page #28) 2nd example (r1,r2....r9) [ 5 marks]
Q # Consider the following Moore machine... (output btane the) lecture # 22
(page # 61) ki 1st example.[3 marks]