Abstract
The family RX∗ of regular subsets of the free monoid X∗ generated by a finite set X is the standard example of a ∗ -continuous Kleene algebra. Likewise, the family CX∗ of context-free subsets of X∗ is the standard example of a μ -continuous Chomsky algebra, i.e. an idempotent semiring that is closed under a well-behaved least fixed-point operator μ . For arbitrary monoids M, CM is the closure of RM as a μ -continuous Chomsky algebra, more briefly, the fixed-point closure of RM . We provide an algebraic representation of CM in a suitable product of RM with C′2 , a quotient of the regular sets over an alphabet Δ2 of two pairs of bracket symbols. Namely, CM is isomorphic to the centralizer of C′2 in the product of RM with C′2 , i.e. the set of those elements that commute with all elements of C′2 . This generalizes a well-known result of Chomsky and Schützenberger (1963, Computer Programming and Formal Systems, 118–161) and admits us to denote all context-free languages over finite sets X⊆M by regular expressions over X∪Δ2 interpreted in the product of RM and C′2 . More generally, for any ∗ -continuous Kleene algebra K the fixed-point closure of K can be represented algebraically as the centralizer of C′2 in the product of K with C′2 .
Dokumententyp: | Zeitschriftenartikel |
---|---|
Fakultätsübergreifende Einrichtungen: | Centrum für Informations- und Sprachverarbeitung (CIS) |
Themengebiete: | 400 Sprache > 400 Sprache |
URN: | urn:nbn:de:bvb:19-epub-94854-7 |
ISSN: | 0960-1295 |
Sprache: | Englisch |
Dokumenten ID: | 94854 |
Datum der Veröffentlichung auf Open Access LMU: | 03. Mrz. 2023, 07:17 |
Letzte Änderungen: | 15. Mrz. 2023, 06:26 |