*-连续Kleene代数不动点闭包的代数表示——范畴Chomsky–Schützenberger定理

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
Hans Leiß
{"title":"*-连续Kleene代数不动点闭包的代数表示——范畴Chomsky–Schützenberger定理","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":"{\"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}","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

摘要

由有限集X生成的自由幺半群$X^*$的正则子集的族${\mathcal{R}}X ^*$是连续Kleene代数的标准例子。同样,$X^*$的上下文无关子集的族${\mathcal{C}}X ^*$是$\mu$连续Chomsky代数的标准例子,即在表现良好的最不定点算子$\mu$$下闭合的幂等半环。对于任意monoids M,${\mathcal{C}}M$是作为$\mu$连续的Chomsky代数的${\ mathcal{R}M$$的闭包,更简单地说,是${\mathcal}M$1的定点闭包。我们在${\mathcal{R}}M$与$C_2'$的适当乘积中提供了${\ mathcal{C}}M$的代数表示,$C_2'$是两对括号符号的字母表$\Delta_2$上的正则集的商。也就是说,${\mathcal{C}}M$同构于${\ mathcal{R}M$C_2'$与$C_2'$$的乘积中的$C_2'$的中心化子,即与$C_2'$的所有元素交换的那些元素的集合。这推广了Chomsky和Schützenberger(1963,Computer Programming and Formal Systems,118-161)的一个著名结果,并允许我们用$X\cup\Delta_2$上的正则表达式来表示有限集$X\substeqM$上的所有上下文无关语言,这些正则表达式被解释为${\mathcal{R}}M$和$C_2'$的乘积。更一般地,对于任何${}^*$-连续的Kleene代数K,K的不动点闭包可以代数地表示为K与$C_2'$的乘积中的$C_2'$。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An algebraic representation of the fixed-point closure of *-continuous Kleene algebras – A categorical Chomsky–Schützenberger theorem
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
Mathematical Structures in Computer Science 工程技术-计算机:理论方法
CiteScore
1.50
自引率
0.00%
发文量
30
审稿时长
12 months
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信