The context free grammar S ? A111|S1, A ? A0 | 00 is equival...

MCQ

The context free grammar S ? A111|S1, A ? A0 | 00 is equivalent to _________

{0ⁿ1^m | n=2, m=3}

{0ⁿ1^m | n=1, m=5}

{0ⁿ1^m | n should be greater than two and m should be greater than four}

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

Which of these does not belong to CFG?

Terminal Symbol

Non terminal Symbol

Start symbol

End Symbol

Discussion

MCQ

The language accepted by this DFA is ---

b*ab*ab*ab*

(a+b)*

b*a(a+b)*

b*ab*ab*

Discussion

MCQ

Which of the following language accepted by a Push down Automata?

Type0

Type1

Type2

Type3

Discussion

MCQ

While converting the context free grammar into Greibach normal form, which of the following is not necessary

Elimination of null production

Elimination of unit production

Converting given grammar in Chomsky normal form

None of these

Discussion

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

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