Show Answer
Sub Topic: Theory of Computation
Posted by: Misha
Show Answer
Sub Topic: Theory of Computation
Posted by: Misha
- A. If it is accepted by automata
- B. If it halts
- C. If automata touch final state in its life time
- D. All language are language of automata
Show Answer
Correct Answer: If it is accepted by automata
Sub Topic: Theory of Computation
Posted by: Misha
- A. Type 0
- B. Type 1
- C. Type 2
- D. Type 3
Show Answer
Sub Topic: Theory of Computation
Posted by: Misha
Show Answer
Sub Topic: Theory of Computation
Posted by: Misha
- A. 1
- B. 2
- C. 3
- D. None of the mentioned
Show Answer
Correct Answer: None of the mentioned
Sub Topic: Theory of Computation
Posted by: Misha
- A. aba*b*bba
- B. ab(ab)*bba
- C. ab(a+b)*bba
- D. All of the mentioned 9.
Show Answer
Correct Answer: ab(a+b)*bba
Sub Topic: Theory of Computation
Posted by: Misha
Show Answer
Sub Topic: Theory of Computation
Posted by: Misha
- A. It can not remember arbitrary large amount of information
- B. It sometimes recognize grammar that are not regular
- C. It sometimes fails to recognize regular grammar
- D. All of the mentioned
Show Answer
Correct Answer: It can not remember arbitrary large amount of information
Sub Topic: Theory of Computation
Posted by: Misha
- A. two
- B. three
- C. four
- D. five
Show Answer
Sub Topic: Theory of Computation
Posted by: Atif
