The set of all strings over ? = {0,1} in which all strings t...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Let G be a context-free grammar where G = ( { S, A, B, C}, { a,b, d}, P, S ) with the productions in P given below.

S ? ABAC
A ? aA ? ?
B ? bB ? ?
C ? d

(? denotes null string). Transform the grammar G to an equivalent context-free grammar G' that has no ? productions and no unit productions. (A unit production is of the form x ? y, and x and y are non terminals.)

the set of all binary strings with unequal number of 0's and 1's

the set of all binary strings including null string

the set of all binary strings with exactly one more 0 than the number of 1

None of the above

Discussion

MCQ

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

{0?1? | n=2, m=3}

{0?1? | n=1, m=5}

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

None of these

Discussion

MCQ

If P & R are regular and also given that if PQ=R, then?

Q has to be regular

Q cannot be regular

Q need not be regular

Q has to be a CFL

Discussion

MCQ

A context free language is called ambiguous if _________

It has 2 or more left derivations for some terminal string ? ? L (G)

It has 2 or more right derivations for some terminal string ? ? L (G)

It has 2 or more left & right derivations for some terminal string ? ? L (G)

None of the mentioned

Discussion

MCQ

A regular Grammer is a ___________

CFG

Non CFG

English Grammer

None of the mentioned

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