Изменения
→Псевдокод
<tex>\mathtt Transitions</tex> {{---}} множество пар <tex>\langle a</tex>, <tex>T \rangle</tex> , где <tex> a \in \Sigma</tex>, <tex>T \in Q</tex>
'''boolean''' dfs(Vertex u, Vertex v)
visited1[u] = '''for'true'' (Transition e : u.transitions) '''if''' ('''not''' visited2[v.transitions.contains(e)) ] = ''true'return''' ''false''
'''if''' (v.transitions.size '''!=''' u.transitions.size)
'''return''' ''false''
'''if''' (v.terminal != u.terminal)
'''return''' ''false''
'''for''' (Transition e : u.transitions)
'''if''' ('''not''' v.transitions.contains(e))
'''return''' ''false''
'''boolean''' result = ''true''
'''for''' (Transition t : u.transitions)
