Menu

Question Discussion & Solution

MCQ
Q.
The finite automata accept the following languages:

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.
Which of the following pairs of regular expressions are equivalent?
forum Discussion
MCQ
2.
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
3.
If R represents a regular language, which of the following represents the Venn-diagram most correctly?

forum Discussion
MCQ
4.
Which of the following statement is correct?
forum Discussion
MCQ
5.
Consider following regular expressioni) (a/b)* ii) (a*/b*)* iii) ((?/a)b*)*
Which of the following statements is correct
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