A machine is represented by states Q, input alphabet Σ, transition function δ,…
2025
A machine is represented by states Q, input alphabet Σ, transition function δ, initial state q₀ and final state F. The machine accepts all the strings over Σ = {a, b}, which start and ended with any combination of all alphabet and abb works/lies as substring in all the strings to be accepted.
Which of the following represented the minimum state DFA for the above specified passage?
Attempted by 72 students.
Show answer & explanation
Correct answer is option D.
A video solution is available for this question — log in and enroll to watch it.