Menu

Question Discussion & Solution

MCQ
Q.
Consider the languages:
L1 = {wwR |w ? {0, 1}*}
L2 = {w#wR | w ? {0, 1}*}, where # is a special symbol
L3 = {ww |  w ?  (0, 1}*)
 Which one of the following is TRUE?

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.
The minimum number of productions required to produce a language consisting of palindrome strings over ?={a,b} is
forum Discussion
MCQ
2. 
The language {am bn Cm+n | m, n ? 1} is
forum Discussion
MCQ
3.
Which of the following strings is not generated by the following grammar?S ? SaSbS|?
forum Discussion
MCQ
4.
S -> aSa|bSb|a|b; The language generated by the above grammar over the alphabet {a,b} is the set of
forum Discussion
MCQ
5.
Given the following statements : (A) A class of languages that is closed under union and complementation has to be closed under intersection. (B) A class of languages that is closed under union and intersection has to be closed under complementation. Which of the following options is correct ?
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