Syntactic Semiring of a Language
暂无分享,去创建一个
A classical construction assigns to any language its (ordered) syntactic monoid. Recently the author defined the so-called syntactic semiring of a language. We discuss here the relationships between those two structures. Pin's refinement of Eilenberg theorem gives a one-to-one correspondence between positive varieties of rational languages and pseudovarieties of ordered monoids. The author's modification uses so-called conjunctive varieties of rational languages and pseudovarieties of idempotent semirings. We present here also several examples of our varieties of languages.
[1] Jorge Almeida,et al. Finite Semigroups and Universal Algebra , 1995 .
[2] Jean-Éric Pin,et al. Syntactic Semigroups , 1997, Handbook of Formal Languages.
[3] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.
[4] Raymond E. Miller,et al. Varieties of Formal Languages , 1986 .