Home / Engineering / Theory of Computation / Question
M
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.
Related MCQs on Theory of Computation
Q. The interrupt vector contains
Q. After the pruning of a priori algorithm,__________will remain
Q. DHCP client and servers on the same subnet communicate via _________
Q. The _____________ helps you to create tree structures of objects.
Q. The association role defines:
Q. ________ can be done for both simple and complex systems.
Discusssion
Login to discuss.