Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
The Minimal number of final states in a minimal DFA that accepts the language: L = { w | w ϵ {0,1}* and w contains an equal occurrences of the substrings ab and ba }
1
5
2
3
3
7
4
4
5
Question Not Attempted