Which of the following language accepted by a Push down Auto...

MCQ

Which of the following language accepted by a Push down Automata?

Type0

Type1

Type2

Type3

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider a CFG with the following productions. S ? AA | B A ? 0A | A0 | 1 B ? 0B00 | 1 S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

{0ⁿ 10²ⁿ | n ? 1}

{0ⁱ 10^j 10^k | i, j, k ? 0} ? {0ⁿ 10²ⁿ | n ? l}

{0ⁱ 10^j | i, j ? 0} ? {0ⁿ 10²ⁿ | n ? l}

The set of all strings over {0, 1} containing at least two 0's

None of the above

Discussion

MCQ

The context free grammar S ? SS | 0S1 | 1S0 | ? generates

Equal number of 0

Unequal number of 0

Any number of 0

None of these

Discussion

MCQ

Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A ? ?, with |?| = k > 1. The derivation tree for any string W ? L (G) has a height such that

h<((|W| - 1)/k-1)

log_k|W| < h

log_k|W| < h < ((|W| - 1)/k-1)

log_k|W| <= h <= ((|W| - 1)/k-1)

Discussion

MCQ

Which of the following pairs have DIFFERENT expressive power?

Deterministic finite automata(DFA) and Non-deterministic finite automata(NFA)

Deterministic push down automata(DPDA)and Non-deterministic push down automata(NPDA)

Deterministic single-tape Turing machine and Non-deterministic single-tape Turing machine

Single-tape Turing machine and multi-tape Turing machine

Discussion

MCQ

Assume the statements S1 and S2 given as:S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same language.
Which of the following is true?

S1 is correct and S2 is not correct

Both S1 and S2 are correct

Both S1 and S2 are not correct

S1 is not correct and S2 is correct

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