engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Finite Automata
The minimal finite automata that accepts all strings of a’s and b’s, where the number of a’s is at least ‘n’ contains
1
n states
2
(n + 1) states
3
(n + 2) states
4
(n + 3) states