gs gs101 Regular Expressions and Languages - Introduction of Regular Expression - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Regular Expressions and Languages. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: L is a regular Language if and only If the set of __________ classes of IL is finite.
Equivalence
Reflexive
Myhill
Nerode
Question 2: A language can be generated from simple primitive language in a simple way if and only if
It is recognized by a device of infinite states
It takes no auxiliary memory
All of the mentioned
None of the mentioned
Question 3: Which of the following does not represents the given language?
Language: {0,01}
Language: {0,01}
0+01
{0} U {01}
{0} U {0}{1}
{0} ^ {01}
Question 4: According to the given language, which among the following expressions does it corresponds to?
Language L={xϵ{0,1}|x is of length 4 or less}
Language L={xϵ{0,1}|x is of length 4 or less}
(0+1+0+1+0+1+0+1)4
(0+1)4
(01)4
(0+1+ε)4
Question 5: Which among the following looks similar to the given expression?
((0+1). (0+1)) *
((0+1). (0+1)) *
{xϵ {0,1} *|x is all binary number with even length}
{xϵ {0,1} |x is all binary number with even length}
{xϵ {0,1} *|x is all binary number with odd length}
{xϵ {0,1} |x is all binary number with odd length}
Question 6: If R represents a regular language, which of the following represents the Venn-diagram most correctly?
An Irregular Set
R*
R complement
R reverse
Question 7: The given NFA corresponds to which of the following Regular expressions?
(0+1) *(00+11) (0+1) *
(0+1) *(00+11) *(0+1) *
(0+1) *(00+11) (0+1)
(0+1) (00+11) (0+1) *
Question 8: Concatenation Operation refers to which of the following set operations:
Union
Dot
Kleene
Two of the options are correct
Question 9: Concatenation of R with Ф outputs:
R
Ф
R.Ф
None of the mentioned
Question 10: RR* can be expressed in which of the forms:
R+
R-
R+ U R-
R
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
