gs gs101 Regular Expressions and Languages - Finding Patterns in Text, Algebric Laws and Derivatives - 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 2: Which of the following regular expression is equivalent to R(1,0)?
R(1,0)={111*}*
R(1,0)={111*}*
(11+111)*
(111+1111)*
(111+11*)*
All of the mentioned
Question 4: The given regular language corresponds to which of the given regular language
e+1+(1+0)*0+(0+1)*11
e+1+(1+0)*0+(0+1)*11
The language of all strings that end with 11 or 00
The language of all strings that end with 0 or 1
The language of all strings which does not end with 01
None of the mentioned
Question 5: Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.
Which of the following is a correct option for the given statement?
Which of the following is a correct option for the given statement?
Absorption Law
Idempotent Law
Closure Law
Commutative Law
Question 8: Choose the incorrect process to check whether the string belongs to the language of certain variable or not?
recursive inference
derivations
head to body method
All of the mentioned
Question 9: Statement: Left most derivations are lengthy as compared to Right most derivations.
Choose the correct option:
Choose the correct option:
correct statement
incorrect statement
may or may not be correct
depends on the language of the grammar
Question 10: A->aAa|bAb|a|b|e
Which among the following is the correct option for the given production?
Which among the following is the correct option for the given production?
Left most derivation
Right most derivation
Recursive Inference
None 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
