I wonder how read the table to determine they are different equivalence class from the table. I cannot understand the table and distinguishing suffixes.

5 = Construct a DFA for S08*1 with the smallest possible number of states, where {0,1}. Prove that your DFA is the smallest possible. Solution. The following DFA with five states recognizes L = 20$*1: no 0, 100 By the Myhill-Nerode theorem, no smaller DFA exists for L because each of the five strings 8,0,00, 01, 001 is in a different equivalence class of = Their distinguishing suffixes are as follows: 0 00 01 001 001 00 1 1 01 001 01 001 1 E 5 = Construct a DFA for S08*1 with the smallest possible number of states, where {0,1}. Prove that your DFA is the smallest possible. Solution. The following DFA with five states recognizes L = 20$*1: no 0, 100 By the Myhill-Nerode theorem, no smaller DFA exists for L because each of the five strings 8,0,00, 01, 001 is in a different equivalence class of = Their distinguishing suffixes are as follows: 0 00 01 001 001 00 1 1 01 001 01 001 1 E