Question Discussion & Solution

MCQ

Which of the following will not be accepted by the following DFA?

ababaabaa

abbbaa

abbaabbaa

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^m | n=2, m=3}

{0ⁿ1^m | n=1, m=5}

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

None of the mentioned

Discussion

MCQ

Which of the expression is appropriate?
For production p: a->b where a?V and b?_______

(V+?)*

V+ ?

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

Regular expressions are used to represent which language?

Recursive language

Regular language

Context free language

All of the above.

Discussion

MCQ

The entity which generate Language is termed as-----

Automata

Grammar

Tokens

Data

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