Question Discussion & Solution

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 ? A111|S1, A ? A0 | 00 is equivalent to

{0?1? | n=2, m=3}

{0?1? | n=1, m=5}

{0?1? | n should be greater than two and m should be greater than four}

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 statement is false?

The context free language can be converted into Chomsky normal form

The context free language can be converted into Greibach normal form

The context free language is accepted by pushdown automata

None of these

Discussion

MCQ

Context free languages are closed under-

Union, Intersection

Union, Kleene closure

Intersection, Complement

Complement, Kleene closure

Discussion

MCQ

Which among the following is the missing transition in the given DFA?
L= {x??= {a, b} | x starts with a and ends with b}

? (q0, a) =q0

? (F, a) =D

? (F, a) =q1

? (q1, a) =D

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