(A) A
(B) B
(C) C
(D) A and B
Author:
According to Mayhill Nerode theorem, if L generates finite no. of classes then L is __.
(A) Regular
(B) Nonregular
(C) Infinite
(D) Infinite
Any word generated by given CFG cannot also be expressed by Syntax tree or Generation tree or Derivation tree as well?
(A) True
(B) False
(C) NA
(D) NA
the moment a final state of __ FA is entered ,the possibility of the initial state of __ FA will be included as well.
(A) first ,third
(B) first ,second
(C) second ,third
(D) all of above
If the intersection of two regular languages is regular then the complement of the intersection of these two languages is also regular:
(A) True
(B) False
(C) NA
(D) NA
If L1 and L2 are regular languages then which statement is NOT true?
(A) (L1/L2 is always regular)
(B) L1+L2 are always regular
(C) L1*l2 are always regular
(D) None of them
CFG is said to be a regular grammar if it generates the regular language i.e.a CFG is said to be a regular grammar in which each production is one of the:
(A) Three forms
(B) One form
(C) Four forms
(D) Two forms
The reverse of the string sbfsbb over { sb, f, b}?
(A) (bsbfsb)
(B) bfsbs
(C) sbbfsb
(D) bbfsb