Teaching HPSC Lecturer (Technical) Mock Test 2024 Theory of Computation Regular Languages and Finite Automata Finite Automata
Consider the following machine:
Language accepted by the above automata is:
1
(0 + 1)∗(10)
2
(0 + 1)∗(10)*
3
(0 + 1)∗(10)1
4
(0 + 1)∗(10)0
5
Question Not Attempted