Editing List of algorithms (section)

===Theory of computation and automata===
{{further|Theory of computation}}
* [[DFA minimization#Hopcroft's algorithm|Hopcroft's algorithm]], [[DFA minimization#Moore's algorithm|Moore's algorithm]], and [[DFA minimization#Brzozowski's algorithm|Brzozowski's algorithm]]: algorithms for [[DFA minimization|minimizing the number of states in a deterministic finite automaton]]
* [[Powerset construction]]: algorithm to convert nondeterministic automaton to [[deterministic automaton]].
* [[Tarski–Kuratowski algorithm]]: a [[non-deterministic algorithm]] which provides an upper bound for the complexity of formulas in the [[arithmetical hierarchy]] and [[analytical hierarchy]]