The minimal automaton accepting our language would have three states corresponding to these three equivalence classes.
接受这个语言的极小自动机有对应于等价类的三个状态。