engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata
Consider a Regular Language L = {w | w starts and ends with same symbol, w \(\in\) {a, b}*}. Let there be a minimal DFA with "X" final states and "Y" non-final states. What is X*Y?
Enter numerical value using the virtual keypad. Round off where necessary.