Q. Which of the following conversion is not possible (algorithmically)? (Solved)
1. regular grammar to context-free grammar
2. non-deterministic finite state automata to deterministic finite state automata
3. non-deterministic pushdown automata to deterministic pushdown automata
4. none deterministic turing machine to deterministic turing machine
- b. non-deterministic finite state automata to deterministic finite state automata