Which of the following pairs have DIFFERENT expressive power...

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

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Let L = {0ⁿ1ⁿ|n ? 0} be a context free language. Which of the following is correct ?

L` is context free and L^k is not context free for any k ? 1.

L` is not context free and L^k is not context free for any k ? 1

Both L` and L^k is for any k ? 1 are context free.

Both L` and L^k is for any k ? 1 are not context free

Discussion

MCQ

Consider the languages L1 = ? and L2 = {1}. Which one of the following represents L*₁? L*₁ L*₂ ?

{?}

{?, 1}

Discussion

MCQ

For S->0S1|e for ?={0,1}*, which of the following is wrong for the language produced?

Non regular language

0ⁿ1ⁿ | n>=0

0ⁿ1ⁿ | n>=1

None of the mentioned

Discussion

MCQ

Production Rule: aAb->agb belongs to which of the following category?

Regular Language

Context free Language

Context Sensitive Language

Recursively Ennumerable Language

Discussion

MCQ

the reverse of the string w. Which of these languages are deterministic Context-free languages?

None of the languages

Only L1

Only L1 and L2

All the three languages

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