arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.02694cs.LOcs.FLmath.CT
收藏

范畴中的句法幺半群

Syntactic Monoids in a Category

Jiri Adamek, Stefan Milius, Henning Urbat

摘要:

将语言的句法幺半群推广到对称幺半群闭范畴D的水平上。这使得在文献中已知的几个概念的语法代数,包括语法幺半群的拉宾和斯科特(D =集),语法半环的Polak(D =半格),和语法结合代数的Rittenauer(D =向量空间)的统一处理。假设D是代数的熵簇,我们证明了语言L的句法D-幺半群可以构造为一个自由D-幺半群模L的句法同余的商,并且它同构于D中L的极小自动机的转移D-幺半群.进一步地,在簇D是局部有限的情况下,我们将正则语言精确地刻画为具有有限句法D-幺半群的语言。

英文摘要:

The syntactic monoid of a language is generalized to the level of a symmetric monoidal closed category D. This allows for a uniform treatment of several notions of syntactic algebras known in the literature, including the syntactic monoids of Rabin and Scott (D = sets), the syntactic semirings of Polak (D = semilattices), and the syntactic associative algebras of Reutenauer (D = vector spaces). Assuming that D is an entropic variety of algebras, we prove that the syntactic D-monoid of a language L can be constructed as a quotient of a free D-monoid modulo the syntactic congruence of L, and that it is isomorphic to the transition D-monoid of the minimal automaton for L in D. Furthermore, in case the variety D is locally finite, we characterize the regular languages as precisely the languages with finite syntactic D-monoids.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑