Question Discussion & Solution

MCQ

Finite-state acceptors for the nested words can be:

nested word automata

push down automata

ndfa

none of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Push down automata accepts which language?

Context sensitive language

Context free language

Recursive language

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

Let L_D be the set of all languages accepted by a PDA by final state and L_F the set of all languages accepted by empty stack. Which of the following is true?

Discussion

MCQ

PDA is more powerful than

Turing machine

Finite automata

Both (a) and (b)

None of these

Discussion

MCQ

Which one of the following statements is FALSE?

There exist context-free languages such that all the context-free grammars generating them are ambiguous

An unambiguous context free grammar always has a unique parse tree for each string of the language generated by it.

Both deterministic and non-deterministic pushdown automata always accept the same set of languages

A finite set of string from one alphabet is always a regular language.

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