BANK IBPS SO Mock Test (Pre + Mains) 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
The number of states in a minimal deterministic finite automaton corresponding to the language
L = an |n ≥ 4| is
1
3
2
4
3
5
4
6
5
7