engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
The number of the final state is p and the number of the non-final state is q for the below-given language
L = {x ϵ {a, b}* | number of a’s in x is divisible by 2 but not divisible by 3}
What is the value of p×q?
1
4
2
6
3
8
4
12