, (5, ⊥ w )}, two cloned states ((0, ) and (1, b)) and two queue states ((⊥, br) and (⊥, bra)).
of the designation of (0, ) as the algorithm addstring Input: [create cloned and queue states; add clones of accepting states to F]  [check queue and cloned states one by one] end for return M = (Q, Σ, δ, q 0 , F) end algorithm Algorithm to add a string w to the language accepted by a finite-state automaton while keeping it minimal.