Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 01, 2013

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

Choose the correct answer:

A) regular grammar to context-free grammar

B) nondeterministic FSA to deterministic FSA

C) nondeterministic PDA to deterministic PDA

D) nondeterministic TM to deterministic TM

Detailed Explanation

Option c is right answer.

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback