Automaton accepting the regular expression of any number of ...

MCQ

Automaton accepting the regular expression of any number of a

ab*

(a/b)*

a*b*c

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Similar Questions

MCQ

Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements?

I only

II only

Both I and II

Neither I nor II

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

CFG (Context Free Grammar) is not closed under

Union

Complementation

Kleene star

Product

Discussion

MCQ

Which of the following statement is false ?

The CFG can be converted to Chomsky normal form

The CFG can be converted to Greibach normal form

CFG is accepted by pushdown automata

None of the mentioned

Discussion

MCQ

Consider a CFG with the following productions. S ? AA | B A ? 0A | A0 | 1 B ? 0B00 | 1 S is the start symbol, A and B are non-terminals and 0 and 1 are the terminals. The language generated by this grammar is

{0ⁿ 10²ⁿ | n ? 1}

{0ⁱ 10^j 10^k | i, j, k ? 0} ? {0ⁿ 10²ⁿ | n ? l}

{0ⁱ 10^j | i, j ? 0} ? {0ⁿ 10²ⁿ | n ? l}

The set of all strings over {0, 1} containing at least two 0's

None of the above

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