Content deleted Content added
+mcnaughton and yamada |
m avoid redirect to wrong person |
||
Line 1:
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 language]]s. Alternative presentations of the same method include "elimination method" attributed to [[Janusz Brzozowski (computer scientist)|Brzozowski]] and [[Edward J. McCluskey|McCluskey]], and the algorithm of [[Robert McNaughton (computer scientist)|McNaughton]] and [[Hisao Yamada|Yamada]].<ref>{{Cite journal|last=McNaughton|first=R.|last2=Yamada|first2=H.|date=1960-3|title=Regular Expressions and State Graphs for Automata|url=https://ieeexplore.ieee.org/document/5221603/|journal=IRE Transactions on Electronic Computers|volume=EC-9|issue=1|pages=39–47|doi=10.1109/TEC.1960.5221603|issn=0367-9950}}</ref>
==Algorithm description==
| |||