Syntactic Semiring of a Language
| Autoři | |
|---|---|
| Rok publikování | 2001 |
| Druh | Článek ve sborníku |
| Konference | Mathematical foundations of computer science 2001 |
| Fakulta / Pracoviště MU | |
| Citace | |
| Obor | Obecná matematika |
| Klíčová slova | syntactic semiring; rational languages |
| Popis | 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. |
| Související projekty: |