info@avatto.com
+91-9920808017
31. Can a DFA simulate NFA?
NO
YES
SOMETIMES
Depends on NFA
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
32. 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
33. Regular expression a / b denotes the set
{a}
{ ∈ , a, b }
{a, b}
{ ab }
34. Regular expression (a | b ) (a | b) denotes the set
{ a, b, ab, aa }
{ a, b, ba, bb }
{ a, b }
{ aa, ab, ba, bb }
35. Which of the following regular expressions denotes zero or more instances of an a or b?
a | b
(ab)*
(a | b)*
a* I b
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
