Kleene star

Kleene star The Kleene star is an operation on sets of finite strings introduced by Stephen Cole Kleene in the 1950s in the context of formal language theory and finite automatons. It produces the smallest monoid containing a given language and plays a central role in the equivalence of regular expressions, regular languages, and finite state machines. The operation connects work by researchers associated with Princeton University, University of Illinois Urbana–Champaign, and institutions linked to early computing such as Bell Labs and the RAND Corporation.

Definition

In formal terms, for a language L over an alphabet Σ the Kleene star is the union of all finite concatenations of elements of L including the empty string ε. Kleene introduced this notion when developing the algebra of regular events in correspondence with machines like the Turing machine, the Post machine, and the Minsky machine. The construction is central to results proved in venues influenced by the ACM and presentations at gatherings such as annual meetings of the American Mathematical Society and conferences sponsored by IEEE.

Properties

The Kleene star yields a language L* that is a submonoid of Σ* and satisfies idempotent-like closure properties used in proofs about Myhill–Nerode theorem, Pumping lemma for regular languages, and minimization theorems for DFAs and NFAs. It interacts with union, concatenation, and intersection with regular sets as encountered in classical texts from authors affiliated with MIT Press, Springer, and departments like Stanford University and University of California, Berkeley. Closure properties under Kleene star are invoked in algorithmic contexts tied to complexity classes studied at Princeton Plasma Physics Laboratory-adjacent workshops and symposia where researchers from Harvard University, Yale University, Columbia University, and Cornell University have presented related work.

Examples

Typical examples demonstrate how Kleene star transforms simple languages: if L = {a} over Σ = {a,b}, then L* = {ε, a, aa, aaa, ...}, a construction used in textbooks from professors at Oxford University, Cambridge University, and by authors from University of Tokyo and Peking University. For L = {ab, ba} one gets sequences like ab, ba, abab, abba, baba, and longer alternations; such examples appear in lecture notes from ETH Zurich, École Polytechnique, and Universität Bonn. In automata constructions, applying Kleene star corresponds to adding ε-transitions in NFA designs, methods taught in courses at University of Illinois Chicago, University of Washington, and Carnegie Mellon University.

Algebraic and language-theoretic applications

Beyond basic language construction, Kleene star is vital in expressing closure under iteration in algebraic structures similar to those studied by mathematicians at Institute for Advanced Study, Max Planck Institute for Mathematics, and CNRS. It features in equivalence proofs between algebraic expressions and computational models in the lineage of work by researchers at Princeton University and Bell Labs, and in applications from model checking in projects associated with NASA and verification efforts by teams at Microsoft Research, Google Research, and IBM Research. The operation is used in pattern matching engines found in tools developed by contributors from GNU Project, Apache Software Foundation, and companies like Oracle Corporation and Adobe Systems.

Variations and generalizations

Generalizations include positive closure (Kleene plus), iteration operators in weighted formal languages studied at institutions like École Normale Supérieure and Tokyo Institute of Technology, and omega-iteration for infinite words as in ω-regular languages researched by groups at University of California, Los Angeles, Tel Aviv University, and Technion. Algebraic extensions connect to semiring-based frameworks used in work at SRI International and Siemens AG and to star-continuous Kleene algebras developed in collaborations involving University of Amsterdam and Imperial College London. Other variants appear in categorical treatments influenced by seminars at University of Cambridge and Princeton University.

Category:Formal languages