Изменения
→Алгоритм
'''for''' (<tex>p</tex> '''in''' <tex>p_d</tex>)
<tex>q_d</tex> = <tex>q_d \cup \{ \delta_0(p, c) \}</tex>
<tex>\delta(p_d, q_d)</tex> = <tex>c</tex>
'''if''' (<tex>q_d</tex> '''not in''' <tex>Q</tex>)
<tex>P</tex>.push(<tex>q_d</tex>)
<tex>Q</tex>.add(<tex>q_d</tex>) <tex>\delta(p_d, q_d)T</tex> = <tex>c</tex> '''for''' (<tex>\{q</tex> '''\in''' <tex>Q</tex>) '''if''' (<tex>\mid \exists q_d</tex> '''p \in''' <tex>qT : q_d</tex> '''p \in''' <tex>T_0</tex>) <tex>T</tex>.add<tex>(q)\}</tex>
'''return''' <tex>\langle \Sigma, Q, \{s\}, T, \delta \rangle</tex>
