L 1.89 | Compound Automata concept with with example | Compound DFA concept with example
Consider the following language.
L = { x∈{a,b}* ∣ number of a’s in x divisible by 2 but not divisible by 3 }
The minimum number of states in DFA that accepts L is _________ .
Note – This question was Numerical Type.
(A) 6
(B) 5
(C) 7
(D) 4
#TOC_for_GATE
#Theory_of_Computation
#TOC_by_VinodYadav
#Complete_TOC
#TOC_SuccessGATEway
#GATE_CS_Lectures
#PSU
#GATE_lectures
#universityexams