engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Regular Languages and Finite Automata Finite Automata
What will be the number of states in the minimal DFA which accepts the language represented by regular expression (a + aaa)* over the alphabet {a}?
1
1
2
2
3
3
4
4