 Kleene's algorithm

In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton (NFA) into a regular expression.Together with other conversion algorithms, it establishes the equivalence of several description formats for regular languages.