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.
If ?= {0,1}, then ?* will result to:
Correct Answer: A
The star operation brings together any number of strings from the language to get a string in the result. If the language is empty, the star operation can put together 0 strings, resulting only the empty string.
MCQ
2.
Which of the following pairs of regular expressions are equivalent?
Correct Answer: D
Rule (pq)*p=p (qp)*
Therefore
MCQ
3.
The finite automata accept the following languages:
Correct Answer: C
A finite automaton accepts the languages which are regular and for which a DFA can be constructed.
MCQ
4.
Which among the following is not an associative operation?
Correct Answer: D
It does not matter in which order we group the expression with the operators as they are associative. If one gets a chance to group the expression, one should group them from left for convenience. For instance, 012 is grouped as (01)2.
MCQ
5.
The regular expressions denote zero or more instances of an x or y is
Correct Answer: B
For instances of x or y the exp is x+y and both can zero or more times than (x+y)*.
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