Syntactic Semiring of a language (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2136, Issue , 2001, Pages 611-620

  Polák, Libor ^a  

^a MASARYK UNIVERSITY   (Czech Republic)

Author keywords

Rational languages; Syntactic semiring

Indexed keywords

ALGEBRA;

EILENBERG THEOREMS; EXTENDED ABSTRACTS; IDEMPOTENT SEMIRINGS; ORDERED MONOIDS; PSEUDOVARIETIES; RATIONAL LANGUAGES; SEMI-RING; SYNTACTIC MONOID;

SYNTACTICS;

EID: 84974725321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44683-4_53     Document Type: Conference Paper

References (6)

1. Almeida, J.; Finite Semigroups and Universal Algebra, World Scientific, 1994
2. Eilenberg, S.; Automata, Languages and Machines, Vol. B, Academic Press, 1976
3. Pin, J.-E.; Varieties of Formal Languages, Plenum, 1986
4. Pin, J.-E.; A variety theorem without complementation, Izvestiya VUZ Matematika 39 (1995) 80-90. English version: Russian Mathem. (Iz. VUZ) 39 (1995) 74-83
5. Pin, J.-E.; Syntactic semigroups, Chapter 10 in Handbook of Formal Languages, G. Rozenberg and A. Salomaa eds, Springer, 1997.
6. Polák, L.; A classification of rational languages by semilattice-ordered monoids, http://www.math.muni.cz/~polak