Which of the following statement is false?...

MCQ

Which of the following statement is false?

Let L is a language accepted by a PDA P then there exist a CFG G L such that L(G) =N(P)

If L is a CFL then there exists a push down automata P accepting CFL L by empty stack i.e. L = N(P)

If L is a language accepted by PDA A by final state there exist a PDA B that accepts L by empty stack such that L =L(A) = N(B)

All 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

Define for a context free language L ? {0, 1}* , init(L)={u ? uv ? L for some v in {0,1}?} ( in other words, init(L) is the set of prefixes of L) Let L = {w ? w is nonempty and has an equal number of 0

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

A DPDA is a PDA in which:

No state p has two outgoing transitions

More than one state can have two or more outgoing transitions

Atleast one state has more than one transitions

None of the mentioned

Discussion

MCQ

A push down automata is different than finite automata by

Its memory (stack)

Number of states

Both (a) and (b)

None of these

Discussion

MCQ

Pushdown automata can recognize language generated by_________.

Only context free grammar

Only regular grammar

Context free grammar or rergular gramma

Only context sensitive grammar

Discussion

MCQ

Which of the following is a simulator for non deterministic automata?

JFLAP

Gedit

FAUTO

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