The total number of states to build the given language using DFA: – McqOptions

MCQOPTIONS

1.	The total number of states to build the given language using DFA:
A.	L= {w \| w has exactly 2 a’s and at least 2 b’s}
B.	10
C.	11
D.	12
E.	13
Answer» B.

Discussion

No Comment Found

Related MCQs

The total number of states to build the given language using DFA:
Predict the number of transitions required to automate the following language using only 3 states:
John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?