Pushdown automata can recognize language generated by_______...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

If L1 is a context free language and L2 as a regular language, which of the following is/are False? a. L1-L2 is not context free b. L1 ? L2 is context free c. ~L1 is context free d. ~L2 is regular

Only b

Only c

Both a and c

Both b and c

Discussion

MCQ

Which of the following languages are context-free?

L1 = {ambnanbm ? m, n ? 1}
L2 = {ambnambn ? m, n ? 1}
L3 = {ambn ? m = 2n + 1}

L1 and L2 only

L1 and L3 only

L2 and L3 only

L3 only

Discussion

MCQ

State true or false:Statement: For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.

true

false

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

Finite-state acceptors for the nested words can be:

nested word automata

push down automata

ndfa

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