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 automaton corresponding to the language
L = an |n ≥ 6| is
Enter numerical value using the virtual keypad. Round off where necessary.