engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following language.
L = {w ϵ {4, 8}*| number of 4’s in w is not divisible by 4 but divisible by 3}
What is the minimum number of states in a DFA that accepts L?
Enter numerical value using the virtual keypad. Round off where necessary.