Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Regular Languages
Which one of the following regular expressions over {0, 1} denotes the set of all strings with even no of 0’s and does not contain 101 as substring?
1
0*(1+10)*
2
1*(00*1)*
3
(1*(00)*1*)* + (01*0)*
4
(0+01*)*
5
Question Not Attempted