Q.

Which of the following is true with respect to Kleene’s theorem?
1 A regular language is accepted by a finite automaton.
2 Every language is accepted by a finite automaton or a turingmachine.

A. 1 only
B. 2 only
C. Both 1 and 2 are true statements
D. None is true
Answer» C. Both 1 and 2 are true statements

View all MCQs in

Theory of Computation

Discussion

No comments yet

Related MCQs