Consider the following Deterministic Finite Automata. Which of the following…
2015
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 95 students.
Show answer & explanation
Correct answer: B
The DFA accepts strings containing the substring 'aababb'. The path from start to final state spells 'aababb', and the final state has self-loops for 'a' and 'b', allowing any characters to follow. Thus, the language is all strings where 'aababb' appears as a substring.
A video solution is available for this question — log in and enroll to watch it.