(A) Regular
(B) Nonregular
(C) Finite
(D) Infinite
Tag: Theory of Automata
TM is more powerful than FSM because?
(A) The tape movement is confined to one direction
(B) It has no finite state control
(C) It has the capability to remember arbitrary long sequences of input symbols
(D) None of these
In pumping lemma theorem (x y^n z) the range of n is?
(A) n=1, 2, 3, 4……….
(B) n=0, 1, 2, 3, 4……….
(C) n=…….-3,-2,-1, 0, 1, 2, 3, 4……
(D) n=…….-3,-2,-1, 1, 2, 3, 4……
Between the two consecutive joints on a path?
(A) One character can be pushed and one character can be popped
(B) Any no. of characters can be pushed and one character can be popped
(C) One character can be pushed and any no. of characters can be popped
(D) Any no. of characters can be pushed and any no. of characters can be popped
The __ is said to be ambiguous if there exist at least one word of its language that can be generated by the different production tree?
(A) CFL
(B) CFG
(C) GTG
(D) None of the given
All NonNull words of the CFL can be generated by the corresponding CFG which is in CNF i.e the grammar in CNF will generate the same language except the?
(A) string
(B) regular language
(C) null string
(D) non of above
= language of words containing even number of a’s. Regular Expression is.
(A) (a+b)*aa(a+b)*
(B) (b+ab*a)*
(C) a+bb*aab*a
(D) (a+b)*ab(a+b)*
For language L defined over {a, b}, then L partitions ,a, b-* into __ classes.
(A) Infinite
(B) Finite
(C) Distinct
(D) Non-distinct