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.
Concatenation Operation refers to which of the following set operations:
A
Union
B
Dot
C
Kleene
D
Two of the options are correct
Correct Answer: B
Two operands are said to be performing Concatenation operation AB = A
MCQ
2.
The production Grammar is {S->aSbb,S->abb} is
A
Type-3 grammar
B
Type-2 grammar
C
Type-1 grammar
D
Type-0 grammar
Correct Answer: B
As per the definition of type-2 grammar.
MCQ
3.
Which of the following does not represents the given language?
Language: {0,01}
Language: {0,01}
A
0+01
B
{0} U {01}
C
{0} U {0}{1}
D
{0} ^ {01}
Correct Answer: D
The given option represents {0, 01} in different forms using set operations and Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid regular expressions when used.
MCQ
4.
If ? = {a, b, c, d, e, f} then number of strings in ? of length 4 such that no symbol is used more than once in a string is
A
35
B
360
C
49
D
720
Correct Answer: B
Here string length is 4 so we create string of length 4 by 6 values firstly we arrange any value by 6 methods. Then Remaining numbers are 5 so we can arrange them by 5 methods then remaining numbers are 4 so we arrange them by 4 methods and then 3.Thus 6*5*4*3=360.
MCQ
5.
The given NFA corresponds to which of the following Regular expressions?

A
(0+1) *(00+11) (0+1) *
B
(0+1) *(00+11) *(0+1) *
C
(0+1) *(00+11) (0+1)
D
(0+1) (00+11) (0+1) *
Correct Answer: A
The transition states shown are the result of breaking down the given regular expression in fragments. For dot operation, we change a state, for union (plus) operation, we diverge into two transitions and for Kleene Operation, we apply a loop.
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