Live briefing
Everything about Kleene's algorithm
Algorithm in theoretical computer science
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. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Kleene's algorithmA 5-minute orientation
- Skim a recent paper: Algorithmic complexity for theories of commutative Kleene algebrasInfluential work since 2022
- Pick up a classic book: Mathematical structures for computer scienceThe most-reprinted book on the subject
- Read the landmark paper: Eigenvectors determination of the ribosome dynamics model during mRNA translation using the Kleene Star algorithmCited 1 times
- Go sideways: Nondeterministic finite automatonA closely related topic
- Go sideways: Alternating finite automatonA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Eigenvectors determination of the ribosome dynamics model during mRNA translation using the Kleene Star algorithm
An efficient algorithm for finding kleene closure of regular expression matrices
🆕 Influential since 2022
đź“š Books worth reading
Mathematical structures for computer scienceJudith L. Gersting · 1982
Three Views of LogicDonald W. Loveland, Richard E. Hodel · 2014
Theoretical foundations of computer scienceDino Mandrioli · 1987
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Nondeterministic finite automaton In automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source…
- Alternating finite automaton In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal…
- Deterministic finite automaton In the theory of computation, a branch of theoretical computer science, a deterministic finite automaton (DFA) is a finite-state machine that accepts or…
- Automata theory Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in…
- Permutation automaton In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set…
- Semi-deterministic Büchi automaton In automata theory, a semi-deterministic Büchi automaton (also known as Büchi automaton deterministic in the limit, or limit-deterministic Büchi automaton)…
- Nested word In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalizat…
- Pushdown automaton In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown…