Menu

Question Discussion & Solution

MCQ
Q.
Regular grammar is

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.
For an automata, which of the following are equivalant variants ?DFA,NFA and NFA  with epsilon transitions
forum Discussion
MCQ
2.
L is a regular Language if and only If the set of __________ classes of IL is finite.
forum Discussion
MCQ
3.
Which of the following pairs of regular expressions are equivalent?
forum Discussion
MCQ
4.
If P, Q, R are three regular expressions and if P does not contain a then the equation R = R + RP has a unique solution given by
forum Discussion
MCQ
5.
For the given Regular expression, the minimum number of terminals required to derive its grammer is:(011+1)*(01)*
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