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!
sync
Loading more...
You must be logged in to participate in the discussion.
login Login to Discussauto_awesome Similar Questions
MCQ
1.
L is a regular Language if and only If the set of __________ classes of IL is finite.
Correct Answer: A
According to Myhill Nerode theorem, the corollary proves the given statement correct for equivalence classes.
MCQ
2.
Which of the follwing options is incorrect?
Correct Answer: B
MCQ
3.
How many strings of length less than 4 contains the language described by the regular expression (x+y)*y(a+ab)*?
Correct Answer: C
string of length 0 = Not possible (because y is always present).
string of length 1 = 1 (y)
string of length 2 = 3 (xy,yy,ya)
string of length 3 = 8 (xxy,xyy,yxy,yyy,yaa,yab,xya,yya)
MCQ
4.
Regular Expression R and the language it describes can be represented as:
Correct Answer: C
When we wish to distinguish between a regular expression R and the language it represents; we write L(R) to be the language of R.
MCQ
5.
Which among the following is equivalent to the given regular expression?
01*+1
01*+1
Correct Answer: C
Using the rules of precedence on the give expression, c is the appropriate choice with the order of: Bracket>Kleene>Dot>Union
category More Theory of Automata Topics
article
Reqular Expressions
format_list_bulleted
114 MCQs
article
Finite Automata
format_list_bulleted
44 MCQs
article
Context Free Grammars
format_list_bulleted
76 MCQs
article
Push Down Automata
format_list_bulleted
37 MCQs
article
Regular and context free languages
format_list_bulleted
65 MCQs
article
Pumping Lemma
format_list_bulleted
14 MCQs
article
Turning Machine
format_list_bulleted
14 MCQs