Menu

Question Discussion & Solution

MCQ
Q.
Let the class of language accepted by finite state machine be L1 and the class of  languages represented by regular expressions be L2 then

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.
Let L denotes the language generated by the grammar S
forum Discussion
MCQ
2.
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
forum Discussion
MCQ
3.
Number of states of FSM required to simulate behaviour of a computer with a memory capable of storing
forum Discussion
MCQ
4.
what does the following segment of codes here?grep -i men heroes.txt
forum Discussion
MCQ
5.
Which of the following pairs of regular expressions are equivalent?
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