gs gs101 Regular Expressions and Languages - Building Regular Expressions - 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: Which of the following is correct?
Statement 1: ε represents a single string in the set.
Statement 2: Ф represents the language that consist of no string.
Statement 1: ε represents a single string in the set.
Statement 2: Ф represents the language that consist of no string.
Statement 1 and 2 both are correct
Statement 1 is false but 2 is correct
Statement 1 and 2 both are false
There is no difference between both the statements, ε and Ф are different notation for same reason
Question 2: The appropriate precedence order of operations over a Regular Language is
Kleene, Union, Concatenate
Kleene, Star, Union
Kleene, Dot, Union
Star, Union, Dot
Question 3: Regular Expression R and the language it describes can be represented as:
R, R(L)
L(R), R(L)
R, L(R)
All of the mentioned
Question 4: Let for ∑= {0,1} R= (∑∑∑) *, the language of R would be
{w | w is a string of odd length}
{w | w is a string of length multiple of 3}
{w | w is a string of length 3}
All of the mentioned
Question 5: If ∑= {0,1}, then Ф* will result to:
ε
Ф
∑
None of the mentioned
Question 6: The given NFA represents which of the following NFA
(ab U a) *
(a*b* U a*)
(ab U a*)
(ab)* U a*
Question 7: Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?
(0+10)*(1+ε)
(0+10)*(1+ε)*
(0+101)*(0+ε)
(1+010)*(1+ε)
Question 8: The finite automata accept the following languages:
Context Free Languages
Context Sensitive Languages
Regular Languages
All the mentioned
Question 9: (a + b*c) most correctly represents:
(a +b) *c
(a)+((b)*.c)
(a + (b*)).c
a+ ((b*).c)
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
