Back to Questions

Computer Science Fundamentals Algorithms Objective

Mar 05, 2013

If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called

Choose the correct answer:

A) decidable

B) undecidable

C) interpretive

D) non-deterministic

Detailed Explanation

Option a is right answer.

Discussion (0)

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

Share Your Thoughts

Feedback