Categories

Theory of Computation-2

CSE - Theory of Computation - Questions and solutions-2
Question:-
Option (A)
n!
Option (B)
n2
Option (C)
nn
Option (D)
2n
Correct Option:
D
Question:-
Option (A)
Moore and Mealy machines are FSM’s with output capacity
Option (B)
Any given Moore machine has an equivalent Mealy machine
Option (C)
Any given mealy machine has an equivalent moore machine
Option (D)
Moore machine is not an FSM
Correct Option:
A,B,C
Question:-
Option (A)
A Mealy macjine generates no language as such
Option (B)
A Moore machine generates no languge as such
Option (C)
A Mealy machine has no terminal state
Option (D)
For a given input string. Length of the string generated by Moore machine is one
Correct Option:
A,B,C,D
Question:-
Option (A)
The output of the former depends on the present state and the current input
Option (B)
The output of the former depends only on the present sate
Option (C)
The output of the former depends only on the present state
Option (D)
None of above
Correct Option:
B
Question:-
Option (A)
Any grammar
Option (B)
Only CFG
Option (C)
Any unambiguous grammar
Option (D)
Only regular rgammar
Correct Option:
D
Question:-
Option (A)
A given grammar is regular
Option (B)
A given grammar is not regular
Option (C)
Whether two given regular expression are equivalent
Option (D)
None of the above
Correct Option:
B