MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
The total number of states required to automate th...
1.
The total number of states required to automate the given regular expression(00)*(11)*
A.
3
B.
4
C.
5
D.
6
Answer» D. 6
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Generate a regular expression for the given language:lL(x): {x {0,1}*| x ends with 1 nd does not contain a substring 01}
The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3
Generate a regular expression for the following problem statement:P(x): String of length 6 or less for ={0,1}*
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.
The total number of states required to automate the given regular expression(00)*(11)*
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply