Which of the following conversion is not possible (algorithm...

MCQ

Which of the following conversion is not possible (algorithmically)?

Regular grammar to CFG

NDFA to DFA

NDPDA to DPDA

NDTM to DTM

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

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

Equal number of 0

Unequal number of 0

Number of 0

None of the mentioned

Discussion

MCQ

Consider the following context-free grammar over the alphabet ? = {a, b} with S as the start symbol:

S ? AT 
A ? aAa | bAb | #T 
T ? aT | bT | ?

Which of the following represents the language generated by the above grammar?

{ w#x | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w is a substring of x, where w, x ? {a, b}* }

x#w | w^R is a substring of x, where w, x ? {a, b}* }

{ w#x | w, x ? {a, b}* }

Discussion

MCQ

Assume Statement S1 and S2 defined as:S1:L2-L1 is recursive enumerable Where L1 and L2 are recursive and recursive enumerable respectively. S2: The set of all Turnig machine is countable. Which of the following is true?

S1 is correct ans 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

MCQ

Push down automata excepts which language ?

Context Sensitive Language

Context free Language

Recursive Language

None of the mentioned

Discussion

MCQ

Which of these does not belong to CFG ?

Terminal Symbol

Non Terminal Symbol

Start Symbol

End Symbol

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