Menu

Question Discussion & Solution

MCQ
Q.
For the given Regular expression, the minimum number of terminals required to derive its grammer is:(011+1)*(01)*

forum Community Discussion

speaker_notes_off

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

login Login to Discuss

auto_awesome Similar Questions

MCQ
1.
The set of all strings over ? = {a,b} in which all strings having bbbb as substring is
forum Discussion
MCQ
2.
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing
forum Discussion
MCQ
3.
An FSM with
forum Discussion
MCQ
4.
Which of the following is not a regular expression?
forum Discussion
MCQ
5.
A regular language over an alphabet a is one that can be obtained from
forum Discussion

category More Theory of Automata Topics

article

Reqular Expressions

format_list_bulleted 114 MCQs
Practice arrow_forward
article

Finite Automata

format_list_bulleted 44 MCQs
Practice arrow_forward
article

Context Free Grammars

format_list_bulleted 76 MCQs
Practice arrow_forward
article

Push Down Automata

format_list_bulleted 37 MCQs
Practice arrow_forward
article

Regular and context free languages

format_list_bulleted 65 MCQs
Practice arrow_forward
article

Pumping Lemma

format_list_bulleted 14 MCQs
Practice arrow_forward
article

Turning Machine

format_list_bulleted 14 MCQs
Practice arrow_forward