{"title":"An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem","authors":"Hans Leiß","doi":"10.1017/S0960129522000329","DOIUrl":null,"url":null,"abstract":"Abstract The family \n${\\mathcal{R}} X^*$\n of regular subsets of the free monoid \n$X^*$\n generated by a finite set X is the standard example of a \n${}^*$\n -continuous Kleene algebra. Likewise, the family \n${\\mathcal{C}} X^*$\n of context-free subsets of \n$X^*$\n is the standard example of a \n$\\mu$\n -continuous Chomsky algebra, i.e. an idempotent semiring that is closed under a well-behaved least fixed-point operator \n$\\mu$\n . For arbitrary monoids M, \n${\\mathcal{C}} M$\n is the closure of \n${\\mathcal{R}}M$\n as a \n$\\mu$\n -continuous Chomsky algebra, more briefly, the fixed-point closure of \n${\\mathcal{R}} M$\n . We provide an algebraic representation of \n${\\mathcal{C}} M$\n in a suitable product of \n${\\mathcal{R}} M$\n with \n$C_2'$\n , a quotient of the regular sets over an alphabet \n$\\Delta_2$\n of two pairs of bracket symbols. Namely, \n${\\mathcal{C}}M$\n is isomorphic to the centralizer of \n$C_2'$\n in the product of \n${\\mathcal{R}} M$\n with \n$C_2'$\n , i.e. the set of those elements that commute with all elements of \n$C_2'$\n . 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 \n$X\\subseteq M$\n by regular expressions over \n$X\\cup\\Delta_2$\n interpreted in the product of \n${\\mathcal{R}} M$\n and \n$C_2'$\n . More generally, for any \n${}^*$\n -continuous Kleene algebra K the fixed-point closure of K can be represented algebraically as the centralizer of \n$C_2'$\n in the product of K with \n$C_2'$\n .","PeriodicalId":49855,"journal":{"name":"Mathematical Structures in Computer Science","volume":"32 1","pages":"685 - 728"},"PeriodicalIF":0.4000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical Structures in Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1017/S0960129522000329","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract The family
${\mathcal{R}} X^*$
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
${\mathcal{C}} X^*$
of context-free subsets of
$X^*$
is the standard example of a
$\mu$
-continuous Chomsky algebra, i.e. an idempotent semiring that is closed under a well-behaved least fixed-point operator
$\mu$
. For arbitrary monoids M,
${\mathcal{C}} M$
is the closure of
${\mathcal{R}}M$
as a
$\mu$
-continuous Chomsky algebra, more briefly, the fixed-point closure of
${\mathcal{R}} M$
. We provide an algebraic representation of
${\mathcal{C}} M$
in a suitable product of
${\mathcal{R}} M$
with
$C_2'$
, a quotient of the regular sets over an alphabet
$\Delta_2$
of two pairs of bracket symbols. Namely,
${\mathcal{C}}M$
is isomorphic to the centralizer of
$C_2'$
in the product of
${\mathcal{R}} M$
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\subseteq M$
by regular expressions over
$X\cup\Delta_2$
interpreted in the product of
${\mathcal{R}} M$
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'$
.
期刊介绍:
Mathematical Structures in Computer Science is a journal of theoretical computer science which focuses on the application of ideas from the structural side of mathematics and mathematical logic to computer science. The journal aims to bridge the gap between theoretical contributions and software design, publishing original papers of a high standard and broad surveys with original perspectives in all areas of computing, provided that ideas or results from logic, algebra, geometry, category theory or other areas of logic and mathematics form a basis for the work. The journal welcomes applications to computing based on the use of specific mathematical structures (e.g. topological and order-theoretic structures) as well as on proof-theoretic notions or results.