Question:

Which of the following conversion is not possible (algorithmically)?

A.

regular grammar to context-free grammar

B.

non-deterministic finite state automata to deterministic finite state automata

C.

non-deterministic pushdown automata to deterministic pushdown automata

D.

none deterministic turing machine to deterministic turing machine

Answer» b. non-deterministic finite state automata to deterministic finite state automata