info@avatto.com
+91-9920808017
0. There are exactly __________ different finite automata with three states x, y and z over the alphabet {a, b} where x is always the start state.
64
56
1024
5832
You must be logged in to post a 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
You must be logged in to post a comment.