engineering recuitment ISRO Scientist Computer Science Mock Test Theory of Computation Recursively Enumerable Sets, Turing Machines and Undecidability Turing Machines
Which of the following statement is false?
1
Every regular language is also a context free language
2
Every subset of recursively enumerable set is recursive
3
Every non-deterministic Turing machine can be converted to an equivalent deterministic Turing machine
4
Every NFA can be converted into equivalent DFA