engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
The following finite state machine accepts all those binary strings in which the number of x’s and y’s are respectively
1
divisible by 3 and 4
2
divisible by 4 and 3
3
divisible by 4 or 3
4
even and odd