Which of the following statement is false?...

MCQ

Which of the following statement is false?

Context free language is the subset of context sensitive language

Regular language is the subset of context sensitive language

Recursively ennumerable language is the super set of regular language

Context sensitive language is a subset of context free language

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

A context free language is called ambigous if ______________

it has 2 or more left derivations for some terminal string w e L(G)

it has 2 more or more right derivations for some terminal string w e L(G)

it has two or more left & right derivations for some terminal string w e L(G)

None of the mentioned

Discussion

MCQ

A regular Grammer is a ___________

CFG

Non CFG

English Grammer

None of the mentioned

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

Consider the following grammars G1 and G2 respectively. Grammar - G1:

A1 ? A2A3
A2 ? A3A1 | b
A3 ? A1A1 | a

Grammar - G2:

S ? AA | 0
A ? SS | 1

Consider the following statements regarding above grammars: (I): This grammar is not left recursive and equivalent to grammar - G1:

A1 ? A2A3
A2 ?  A3A1 | b
A3 ? a | bA3A1 | aK | bA3A1K 
k ? A1A3A1 | A1A3A1K

(II): This grammar is not left recursive and equivalent to grammar - G2:

S ? A A | 0
A ? 0S | 1 | 0SK | 1K
K ? AS | ASK

Only statement (I) is correct

Only statement (II) is correct

Both statements (I) and (II) are correct

Neither statement (I) not (II) is correct

Discussion

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

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