.
N!
N^2
N^n
2^n
The output of the former depend on the present state and the current input
The output of the former depend on the present state
The output of the former depend on the current input
None of these
May be different
Must be different
Must be the same
None of these
Any grammer
Only CFG
Any unambiguous grammar
Only regular grammar
A given grammar is regular
A given grammar is not regular
Whether two given regular expressions are equivalent
None of these
1(01)*0 and (10)*10
X(xx)* and (xx)*x
(ab)*a and a*b*b
X*y and x*x'y
It can't remember arbitrary large amount of information
It sometimes recognizes grammars that are not regular
It sometimes fails to recognize grammars that are regular
All of these
Of finite tape length, rewinding capability and unidirectional tap movement
Of finite tape length, without rewinding capability and unidirectional tape movement
Of finite tape length, without rewinding capability and bidirectional tape movement
Of finite tape length, rewinding capability and bidirectional tape movement
The tape movement is confined to one direction
It has no finite state control
It has the capability to remember arbitrary long sequences of input symbols
None of these
Mealy Machine
Moore Machine
Kleene Machine
None of these
(ab)*a and a(ba)*
(a+b)* and (a* + b)*
(a* +b)* and (a+b)*
None of these
Union
Complementation
Intersection
None the of these
Any string of odd number of a's
Any string of odd number a's and even number b's
Any string of even number of a's and even number of b's
Any string of even number of a's and odd number of b's
Regular expression
DFSM
NDFSM
All of these
All of these
(a + b)*
(a + b)(a + b)*
(a + b)*(a + b)
Has at least one b
Should end in an 'a'
Has no consecutive a's or b's
Has at least two a's
S → ab /aSb
S → aaSbb /ab
S → ab /aSb /€
None of these
All languages can be generated by CFG
Any regular language has an equivalent CFG.
Some non-regular languages can be generated by any CFG
Some regular languages can't be generated by any CFG.
Union
Kleene Star
Complementation
Product
Regular
Context free
Not context free
None of these
Context free
Not context free
Not context free whose complement is not CF
Context free but whose complement is not CF
Need not be regular
Need not be context free
Is complement of regular
Is always CF
Context free
Regular
Context sensitive
LR(k)
Regular Grammar to Context free Grammar
Non deterministic FSA to Deterministic FSA
Non deterministic PDA to Deterministic PDA
Non deterministic TM to Deterministic TM
1
2
3
4