info@avatto.com
+91-9920808017
0. If every string of a language can be determined, whether it is legal or illegal in finite time, the language is called
decidable
undecidable
interpretive
non-deterministic
Your email address will not be published. Required fields are marked *
Report
Name
Email
Website
Save my name, email, and website in this browser for the next time I comment.
Comment
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
