Which of the following statement is false?...

MCQ

Which of the following statement is false?

The context free language can be converted into Chomsky normal form

The context free language can be converted into Greibach normal form

The context free language is accepted by pushdown automata

None of these

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

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

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

Assume statements S1 and S2 defined as: S1: L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turing machines is countable. Which of the following is true?

S1 is correct and S2 is not correct

Both S1 and S2 are correct

Both S1 and S2 are not correct

S1 is not correct and S2 is correct

Discussion

MCQ

Grammar that produce more than one Parse tree for same sentence is ___________

Ambiguous

Unambiguous

Complementation

Concatenation Intersection

Discussion

MCQ

A CFG is close under ________

Union

Kleene star

Concatenation

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