Push down automata accepts which language?...

MCQ

Push down automata accepts which language?

Context sensitive language

Context free language

Recursive language

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

The language accepted by a Pushdown Automation in which the stack is limited to 10 items is best described as

Context Free

Regular

Deterministic Context Free

Recursive

Discussion

MCQ

A regular Grammar is a _________

CFG

Non CFG

English Grammar

None of the mentioned

Discussion

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 PDA machine configuration (p, w, y) can be correctly represented as:

(current state, unprocessed input, stack content)

(unprocessed input, stack content, current state)

(current state, stack content, unprocessed input)

none of the mentioned

Discussion

MCQ

To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions to be used is:

2n - 1

n + 1

n ²

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