Q. Consider the following two statements:

S1: { 0^2n |n >= l} is a regular language
S2: { 0^m 0^n 0^(m+n) l m >= 1 and n >= 2} is a regular language

Which of the following is true?

View solution

Q. Let L denotes the language generated by the grammar S – OSO/00. Which of the following is true?

View solution

Q. Which one of the following statement is FALSE?

View solution

Q. Which of the following strings is not generated by the following grammar?

S → SaSbS|ε

View solution

Q. The production Grammar is {S->aSbb,S->abb} is

View solution

Q. A language L from a grammar G = { VN, Σ, P, S} is

View solution

Q. A regular language corresponds to

View solution

Q. Given the language L = {ab, aa, baa}, which of the following strings are in L*?

1) abaabaaabaa
2) aaaabaaaa
3) baaaaabaaaab
4) baaaaabaa

View solution

Q. Which is a correct statement?

View solution

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