gs gs101 Regular Expressions and Languages - Expression in Regular Language - Quiz No.2
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 2: Which of the following is true?
(01)*0 = 0(10)*
(0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
(0+1)*01(0+1)*+1*0* = (0+1)*
All of the mentioned
Question 3: A language is regular if and only if
accepted by DFA
accepted by PDA
accepted by LBA
accepted by Turing machine
Question 4: Regular grammar is
context free grammar
non context free grammar
english grammar
none of the mentioned
Question 6: Which of the following is not a regular expression?
[(a+b)*-(aa+bb)]*
[(0+1)-(0b+a1)*(a+b)]*
(01+11+10)*
(1+2+0)*(1+2)*
Question 7: Regular expression are
Type 0 language
Type 1 language
Type 2 language
Type 3 language
Question 8: Which of the following is true?
Every subset of a regular set is regular
Every finite subset of non-regular set is regular
The union of two non regular set is not regular
Infinite union of finite set is regular
Question 9: L and ~L are recursive enumerable then L is
Regular
Context free
Context sensitive
Recursive
Question 10: Regular expressions are closed under
Union
Intersection
Kleen star
All of the mentioned
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
