Consider the following Deterministic Finite Automata. Which of the following…
Consider the following Deterministic Finite Automata. Which of the following is true?

- A.
It accepts all strings with prefix as “aababb”
- B.
It accepts all strings with substring as “aababb”
- C.
It accepts all strings with suffix as “aababb”
- D.
None of the above
Attempted by 422 students.
Sign up free to check your answer
Sign up freeLoading lesson…

