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. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma.
- B
- enii
- enij
- enik
- enkj
- enkk
- 0
- 1
- 10
- 11
- 12
- 2
- 20
- 21
- 22
- Comment
- enIn 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. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma.
- Depiction
- Has abstract
- enIn 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. Alternative presentations of the same method include the "elimination method" attributed to Brzozowski and McCluskey, the algorithm of McNaughton and Yamada, and the use of Arden's lemma.
- Is primary topic of
- Kleene's algorithm
- Label
- enKleene's algorithm
- Link from a Wikipage to another Wikipage
- Arden's lemma
- Category:Algorithms
- Category:Finite automata
- Category:Regular expressions
- Deterministic finite automata
- Edward J. McCluskey
- File:Deterministicfiniteautomaton.svg
- Floyd–Warshall algorithm
- Formal language theory
- Generalized star height problem
- Hisao Yamada
- Janusz Brzozowski (computer scientist)
- Kleene
- Kleene algebra
- Nondeterministic finite automaton
- Regular expression
- Regular language
- Robert McNaughton
- Star height
- Star height problem
- Theoretical computer science
- Thompson's construction algorithm
- P
- enk
- enk-1
- enn
- en−1
- 0
- 1
- 2
- SameAs
- Algorisme de Kleene
- Algoritmo de Kleene
- fsao
- Kleene's algorithm
- m.010s99cw
- Q17102078
- الگوریتم کلینی
- Subject
- Category:Algorithms
- Category:Finite automata
- Category:Regular expressions
- Thumbnail
- WasDerivedFrom
- Kleene's algorithm?oldid=1055313212&ns=0
- WikiPageLength
- 17024
- Wikipage page ID
- 42923391
- Wikipage revision ID
- 1055313212
- WikiPageUsesTemplate
- Template:Reflist
- Template:Sfrac
- Template:Su
