engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
If a minimum state DFA accepting the language L = {x| x ϵ {a, b} *, the number of a’s and b’s in x are divisible by 9 and 15 respectively then the number of states in DFA is?
Enter numerical value using the virtual keypad. Round off where necessary.