engineering recuitment GATE CSE 2023-24 Test Series Theory of Computation Regular Languages and Finite Automata Finite Automata
Let the language be L = { w1pqp w2 | w1, w2 ϵ (p + q)* }
The number of equivalence classes exists for L is _____Enter numerical value using the virtual keypad. Round off where necessary.