Q. Which grammar is not regular ?

View solution

Q. Here is a context-free grammar G: S → AB A → 0A1 | 2 B → 1B | 3A . which of the following strings are in L (G)?

View solution

Q. The parse tree below represents a rightmost derivation according to the grammar S → AB, A → aS|a, B → bA. Which of the following are right-sentential forms corresponding to this derivation?

View solution

Q. The grammar G: S → SS | a | b is ambiguous. Check all and only the strings that have exactly two leftmost derivations in G.

View solution

Q. For the following grammar, Identify all the unit pairs.

S → A | B | 2 A → C0 | D B → C1 | E C → D | E | 3 D → E0 | S E → D1 | S

View solution

Q. Which of the following is not regular?

View solution

Q. If L1 and L2 are regular languages is/are also regular language(s).

View solution

Q. If P & R are regular languages and also given that if PQ=R, then

View solution

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