3. [0.4/1 Points] DETAILS MY NOTES EPPDISCMAΤΗΣ 12.3.005.
Consider the finite-state automaton A given by the following transition diagram.
(a) Find the 0-, 1-, 2-, and 3-equivalence classes of states of A. (Enter your answers as comma-separated lists of sets.)
0-equivalence classes
{s2,s5},{s0,s1,s3,s4}
1-equivalence classes
{s2,s5},{s0,s3},{s1,s4}
x
2-equivalence classes
{s2,s5},{s0,s3},{s1,s4}
x
3-equivalence classes
(b) Which of the following is a transition diagram for A, the quotient automaton of A?
[s1]
[s0]
Need Help?
[s1]
[s4]
[s1]
[s4]
([s2])
[s1]
[s2]
[s0]
[]
[s]
PREVIOUS AN