info@avatto.com
+91-9920808017
0. Which of the following statements is wrong?
The language accepted by finite automata are the languages denoted by regular expressions
For every DFA there is a regular expression denoting its language
For a regular expression r, there does not exist NFA with L(r) any transit that accept
None of these
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
