Regarding the power of recognition of languages, which of th...

MCQ

Regarding the power of recognition of languages, which of the following statement is false?

The non-deterministic finite state automata are equivalent to deterministic finite state automata

Non-deterministic pushdown automata is equivalent to deterministic pushdown automata.

Non-deterministic Turing machines are equivalent to deterministic Turing machines.

Multi-tape Turing machines are equivalent to Single-tape Turing machines.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Consider the following languages.

L₁ = {aⁱ b^j c^k | i = j, k ? 1}
L₁ = {aⁱ b^j | j = 2i, i ? 0}
Which of the following is true?

L1 is not a CFL but L2 is

	L1 ? L2 = ? and L1 is non-regular

	L1 ? L2 = ? and L1 is non-regular

There is a 4-state PDA that accepts L1, but there is no DPDA that accepts L2

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

With reference of a DPDA, which among the following do we perform from the start state with an empty stack?

process the whole string

end with an empty stack

all of the mentioned

Discussion

MCQ

Finite-state acceptors for the nested words can be:

nested word automata

push down automata

ndfa

none of the mentioned

Discussion

MCQ

A regular Grammar is a _________

CFG

Non CFG

English Grammar

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

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