A CFG is close under ________...

MCQ

A CFG is close under ________

Union

Kleene star

Concatenation

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the following context-free grammar over the alphabet ? = {a, b} with S as the start symbol:

S ? AT 
A ? aAa | bAb | #T 
T ? aT | bT | ?

Which of the following represents the language generated by the above grammar?

{ w#x | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w is a substring of x, where w, x ? {a, b}* }

x#w | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w, x ? {a, b}* }

Discussion

MCQ

The set of all strings over ? = {0,1} in which all strings that beings and ends with 0 is--------

0(0+1)0

00(0+1)0

00(0+1)11

Discussion

MCQ

The context free grammar S ? SS | 0S1 | 1S0 | ? generates

Equal number of 0

Unequal number of 0

Any number of 0

None of these

Discussion

MCQ

Which of the following language(s) generates more than one parse tree for a string ?

L1 = {a^nb^mc^md^n ? {a, b, c, d}* | n, m ? 0} 
      ? {a^nb^nc^md^m ? {a, b, c, d}* | n, m ? 0} 

L2 = {a^nb^mc^m ? {a, b, c}* | n, m ? 0} 
      ? {a^nb^nc^m ? {a, b, c}* | n, m ? 0}

L3 = {a^nb^mc^p ? {a, b, c}* | n ? m; n, m ? 0} 
      ? {a^nb^mc^p ? {a, b, c}* | m ? p; n, m ? 0}

Only L1 and L2

Only L1 and L3

Only L2 and L3

All L1, L2, and L3

Discussion

MCQ

Which of the following conversion is not possible (algorithmically)?

Regular grammar to CFG

NDFA to DFA

NDPDA to DPDA

NDTM to DTM

Discussion

Banking

Engineering

General

Medical

Question Discussion & Solution

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Banking

Engineering

General

Medical

Question Discussion & Solution

report Report Error

forum Community Discussion

auto_awesome Similar Questions

report Report Error

report Report Error

report Report Error

report Report Error

report Report Error

category More Theory of Automata Topics

Reqular Expressions

Finite Automata

Context Free Grammars

Push Down Automata

Regular and context free languages

Pumping Lemma

Turning Machine

Report Error

Community Discussion

Similar Questions

Report Error

Report Error

Report Error

Report Error

Report Error

More Theory of Automata Topics