engineering recuitment NIELIT Scientific Assistant Mock Test 2025 Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability
Find out the regular expression corresponding to the given DFA.
1
(00 * 1 + 11 * 0) (0 + 1) *
2
(11) * (0 * 1 + 1 * 0) (0 + 1) *
3
((11) * 0 + 00 * 1) (0 + 1) *
4
(11) * (00 * 1 + 10) (0 + 1) *