gs gs101 Regular Expressions and Languages - DFA to 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 same as the given DFA?
(0+1)*001(0+1)*
1*001(0+1)*
(01)*(0+0+1)(01)*
None of the mentioned
Question 2: Which of the following statements is not true?
Every language defined by any of the automata is also defined by a regular expression
Every language defined by a regular expression can be represented using a DFA
Every language defined by a regular expression can be represented using NFA with e moves
Regular expression is just another representation for any automata definition
Question 4: Which of the given regular expressions correspond to the automata shown?
(110+1)*0
(11+110)*1
(110+11)*0
(1+110)*1
Question 5: Generate a regular expression for the following problem statement:
Password Validation: String should be 8-15 characters long. String must contain a number, an Uppercase letter and a Lower case letter.
Password Validation: String should be 8-15 characters long. String must contain a number, an Uppercase letter and a Lower case letter.
^(?=.*[a-z])(?=.*[A-Z])(?=.*\d).{8,15}$
^(?=.*[a-z])(?=.*[A-Z])(?=.*\d).{9,16}$
^(?=.[a-z])(?=.[A-Z])(?=.\d).{8,15}$
None of the mentioned
Question 6: Generate a regular expression for the following problem statement:
P(x): String of length 6 or less for å={0,1}*
P(x): String of length 6 or less for å={0,1}*
(1+0+e)6
(10)6
(1+0)(1+0)(1+0)(1+0)(1+0)(1+0)
More than one of the mentioned is correct
Question 8: Which of the regular expressions corresponds to the given problem statement:
P(x): Express the identifiers in C Programming language
l=letters
d=digits
P(x): Express the identifiers in C Programming language
l=letters
d=digits
The name of the identifier should not begin with a digit.
It can only begin with a letter or a underscore.
It can be of length 1 or more.
(_+d)(l+d+_)*
Question 9: Generate a regular expression for the given language:l
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
L(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
(0+01)*
(0+01)*1
(0+01)*(1+01)
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
