(A) Distinct
(B) Accept
(C) Unit production
(D) None of the above
Author:
If L1 and L2 are two regular languages then L1∩L2 is also?
(A) Regular
(B) None regular
(C) Finite
(D) None infinite
The same non terminals can be written in single line if they have more than one __.
(A) Productions
(B) Regular production
(C) None regular production
(D) None of them
An FA has same initial and final state, then it means that it has no final state?
(A) True
(B) False
(C) NA
(D) NA
Set of all palindromes over {a,b}is regular?
(A) True
(B) False
(C) NA
(D) NA
The production S –> SS | a | b | ^ can be expressed by RE?
(A) (a+b)+
(B) a-b
(C) (a-b)+
(D) None of them
In CFG, the symbols that cannot be replaced by anything are called __.
(A) None terminals
(B) Infinite
(C) Finite
(D) Terminals
The language generated by the CFG is called the language __ by the CFG.
(A) Produced
(B) Null string
(C) Pumping lemma
(D) Non of then