(A) True
(B) False
(C) Such a language does not exist
(D) None of these
Author:
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
The complement of a regular language is also a regular?
(A) True
(B) False
(C) NA
(D) NA
There is at least one production that has one __ on its left side.
(A) Terminal
(B) Infinite
(C) None Terminal
(D) All of above
The two FAs are?
(A) Same
(B) Equivalent
(C) Different
(D) None of them