The total number of states required to automate the given regular exp – McqOptions

MCQOPTIONS

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

Discussion

No Comment Found

Related MCQs

The minimum number of transitions to pass to reach the final state as per the following regular expression is: {a,b}*{baaa}
Generate a regular expression for the given language:lL(x): {xÎ{0,1}*| x ends with 1 nd does not contain a substring 01}
Which of the regular expressions corresponds to the given problem statement:P(x): Express the identifiers in C Programming languagel=lettersd=digits
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.
Which of the given regular expressions correspond to the automata shown?
The total number of states required to automate the given regular expression(00)*(11)*
Which of the following is same as the given DFA?
Diarrhea is caused due to