Question: The total number of states to build the given language using DFA:^ L= {w | w has exactly 2 a's and at least 2 b's}
Options
A : 10
B : 11
C : 12
D : 13
Click to view Correct Answer
Applications of NFA more questions
Which of the following is an application of Finite Automaton?
Which of the following options is correct for the given....
L1= {w | w does not contain the string tr....
Left corner parsing methof uses which of the following?
Predict the number of transitions required to automate the following....
To derive a string using the production rules of a....
Which among the following can be an example of application....
Which among the following is not an application of FSM?
Which of the following is true for shift reduce parsers?
Which of the following parser performs top down parsing?
Ambiguous Grammar more Online Exam Quiz
Applications of Pumping Lemma/Pigeonhole principle
CFG-Eliminating Useless Symbols
Deterministic Finite Automata-Introduction and Definition