engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
The number of states in a minimal Deterministic finite automata (DFA) that accepts the given language L = { 0p1q2r | p,q,r>=1} is
1
4
2
3
3
5
4
6