Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Which of the following pairs have DIFFERENT expressive power?

Choose the correct answer:

A) Deterministic finite automata (DFA) and Non-Deterministic finite automata(NFA)

B) Deterministic push down automata (DPDA) and Non-deterministic pushdown automata

C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing Machine

D) Single-tape Turing machine and multi-tape Turing machine

Detailed Explanation

DPDA cannot handle languages or grammars with ambi

Discussion (0)

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

Share Your Thoughts

Feedback