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.
If the strings of a language L can be effectively enumerated in lexicographic (i.e., alphabetic) order, which of the following statements is true ?
forum Discussion
MCQ
2.
Which variable does not drive a terminal string in grammar? S -> AB A -> a B -> b B -> C
forum Discussion
MCQ
3. 
Given the following two languages: L1 = {anban|n > 0} L2 = {an b an bn + 1|n > 0} Which of the following is correct ?
forum Discussion
MCQ
4.
According to pumping lemma for context free languages: Let L be an infinite context free language, then there exists some positive integer m such that any w ? L with | w | ? m can be decomposed as w = u v x y z
forum Discussion
MCQ
5.
In the correct grammar of above question, what is the length of the derivation (number of steps starring from S) to generate the string albm with l ? m? 
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