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:
Correct Answer: B
Two operands are said to be performing Concatenation operation AB = A
MCQ
2.
Which among the following looks similar to the given expression?((0+1). (0+1)) *
Correct Answer: A
The given regular expression corresponds to a language of binary strings which is of even length including a length of 0.
MCQ
3.
The production Grammar is {S->aSbb,S->abb} is
Correct Answer: B
As per the definition of type-2 grammar.
MCQ
4.
A language can be generated from simple primitive language in a simple way if and only if
Correct Answer: B
A language is regular if and only if it can be accepted by a finite automaton. Secondly, It supports no concept of auxiliary memory as it loses the data as soon as the device is shut down.
MCQ
5.
Regular expression are
Correct Answer: D
According to Chomsky hierarchy,
Type 0
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