Q. In which of the stated below is the following statement true?“For every non-deterministic machine M1, there exists as equivalent deterministic machine M2 recognizing the same language.” (Solved)
1. m1 is a non-deterministic finite automata
2. m1 is a non-deterministic push-down automata
3. m1 is a non-deterministic turing machine
4. for no machine m1 use the above statement true
- c. m1 is a non-deterministic turing machine