A classification of rational languages by semilattice-ordered monoids.

MaRDI QIDQ3435485zbMATH OpenFDO

Authors Libor Polák

Publication date 26 April 2007

Full work available at URL https://eudml.org/doc/127464, http://www.emis.de/journals/AM/04-4/index.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

conjunctive varieties of rational languagessyntactic semilattice-ordered monoid

Mathematics Subject Classification ID

Ordered semigroups and monoids (06F05) Applications of universal algebra in computer science (08A70) Semirings (16Y60) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70)

Recommendations

• Small conjunctive varieties of regular languages
• Eilenberg's theorem for positive varieties of languages
• scientific article; zbMATH DE number 1848285
• Formations of finite monoids and formal languages: Eilenberg's variety theorem revisited.
• scientific article; zbMATH DE number 1944129

Cited in

(18)

• Counting monoids and rational languages
• Representation of normal bands as semigroups of \(k\)-bi-ideals of a semiring
• Eilenberg's theorem for positive varieties of languages
• Profinite topologies
• Some remarks on the Jacobson radical types of semirings and related problems
• Obituary: Libor Polák (1950--2020)
• A positive extension of Eilenberg's variety theorem for non-regular languages
• Canonical finite models of Kleene algebra with tests
• Hierarchies of Piecewise Testable Languages
• scientific article; zbMATH DE number 3912646 (Why is no real title available?)
• scientific article; zbMATH DE number 4035188 (Why is no real title available?)
• RATIONAL LANGUAGES AND INVERSE MONOID PRESENTATIONS
• scientific article; zbMATH DE number 1848285 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• Small conjunctive varieties of regular languages
• Representation theory of finite semigroups over semirings.
• On the varieties of languages associated with some varieties of finite monoids with commuting idempotents
• On varieties of meet automata

This page was built for publication: A classification of rational languages by semilattice-ordered monoids.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3435485)