Q. Which of the following conversion is not possible (algorithmically)?

View solution

Q. Recursively enumerable languages are not closed under:

View solution

Q. Grammar that produce more than one Parse tree for same sentence is:

View solution

Q. Automaton accepting the regular expression of any number of a ‘ s is:

View solution

Q. Grammars that can be translated to DFAs:

View solution

Q. The language accepted by a Push down Automata:

View solution

Q. Given the following statements:

(i) Recursive enumerable sets are closed under complementation.
(ii) Recursive sets are closed under complements.

Which is/are the correct statements?

View solution

Q. Assume statements S1 and S2 defined as:

S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable.

Which of the following is true?

View solution

Q. A context free language is called ambiguous if

View solution

Q. Which of the following statement is false?

View solution

Q. The context free grammar S → A111|S1, A → A0 | 00 is equivalent to

View solution

Q. The context free grammar S → SS | 0S1 | 1S0 | ɛ generates

View solution

Q. Which of the following statement is false?

View solution

Q. Push down automata accepts which language

View solution

Q. A regular Grammar is a

View solution

Q. A CFG is closed under

View solution

Q. Which of these does not belong to CFG ?

View solution

Q. A language is regular if and only if

View solution

Q. Regular grammar is

View solution

Q. Give a production grammar that specified language L = {a^i b^2i >= 1}

View solution