Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Regular Languages
The Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0 and 1.
1
01, 0011,010101
2
0011, 11001100
3
ε, 0011, 11001101
4
ε, 0011, 11001100
5
Question Not Attempted