engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
What is the minimum number of states in deterministic final automata that accept all the strings over \(\Sigma\) = {x, y, z} of x’s, y’s and z’s where the number of x’s divisible by 4, number of y’s divisible by 7, and number of z’s divisible by 2?
Enter numerical value using the virtual keypad. Round off where necessary.