(A) (L1/L2 is always regular)
(B) L1+L2 are always regular
(C) L1*l2 are always regular
(D) None of them
Tag: Theory of Automata
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
One language can have __ CFG(s).
(A) At least one
(B) At least two
(C) At least three
(D) None of them
Consider the following CFG: s→aS|bS|aaS|Λ can be observed that the word aaa can be derived from more than?
(A) One production tree
(B) Two producton tree
(C) Total language tree
(D) All of above
If an FA has N state then it must accept the word of length?
(A) N2
(B) N-1
(C) N+1
(D) all of above
If F accept an __ language then there are some words w.s.t N≤ length (w) <2n?
(A) Regular
(B) Finite
(C) Infinite
(D) None of given
The two regular expressions define the?
(A) same language
(B) The two FAs are equivalent
(C) Both a and b
(D) None of given