engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Let the minimum state DFA accepting the language L1 = {x| x ϵ {p, q}* } in which number of p’s and q’s in x are divisible by 10 and 15 respectively be n and the minimum number of state DFA accepting the language L2 = { w | w ϵ {a}* } in which a is divisible by 10 and 15 be y. The value of n – y is _____.
Enter numerical value using the virtual keypad. Round off where necessary.