kleene's algorithm
/K L IY1 N EH0 S AE0 L G ER0 IH0 DH AH0 M/N
- 1
In theoretical computer science, in particular in formal language theory, Kleene's algorithm transforms a given nondeterministic finite automaton into a regular expression.
Translate “kleene's algorithm” into another language
Choose a language below to open the translator with English selected as the source language.