If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called
A. | decidable |
B. | undecidable |
C. | interpretive |
D. | non-deterministic |
Answer : A Explanation : |
|
Option: A Explanation : Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. Explanation will come here. |