(A) CNF
(B) L
(C) CFL
(D) CFG
Tag: Theory of Automata
In FA starting state is represented by a __ sign.
(A) +
(B) –
(C) *
(D) S
NO164: If r1 = (aa + bb) and r2 = ( a + b) then the language (a + b)* (aa + bb)* will be generated by?
(A) (r2)(r1)
(B) (r1 + r2)*
(C) (r2)*(r1)*
(D) (r1)*
(a+b)*a(a+b)*b(a+b)* is the RE of language defined over ={a,b} having at least one a and one b?
(A) True
(B) False
(C) Such a language does not exist
(D) None of these
a^n b^n generates the __ language.
(A) Non regular languages
(B) Regular language
(C) Infinite language
(D) Finite language
For FA corresponding To (L1∩L2c)U (L1c∩L2) the regular expression ca be determined that defines the language accepted by this?
(A) TG
(B) GFC
(C) FA
(D) GTG
In pref(Q in R) Q is __ to (than) R.
(A) Q is not equal to R
(B) Q is equal to R
(C) Q is infinite
(D) None of them
If an effectively solvable problem has answer in yes or no ,then this solution is called?
(A) Decision procedure
(B) Decidable problem
(C) Solved able problem
(D) All of above