Menu

Question Discussion & Solution

MCQ
Q. 
Let P be a regular language and Q be context-free language such that Q 	\subseteq P. (For example, let P be the language represented by the regular expression p*q* and Q be {pnqn|n \in N}). Then which of the following is ALWAYS regular?

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
What is the number of steps required to derive the string ((() ()) ())

S ? SS
S ? (S)
S ? ?
forum Discussion
MCQ
2.
Given the following grammars: G1: S ? AB|aaB A ? aA | ? B ? bB | ? G2: S ? A|B A ? aAb | ab B ? abB | ? Which of the following is correct?
forum Discussion
MCQ
3.
Consider the language L = { an ? n?0 }?{ anbn ? n?0 } and the following statements.I. L is deterministic context-free.II. L is context-free but not deterIII. L is not LL(k) for any k.Which of the above statements is/are TRUE ?
forum Discussion
MCQ
4.
Which of the following sentences can be generated by

S -> aS | bA
A -> d | cA
forum Discussion
MCQ
5.
  
the reverse of the string w. Which of these languages are deterministic Context-free languages?
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward