On varieties of meet automata

DOI10.1016/j.tcs.2008.06.005zbMath1154.68070OpenAlexW1989353904MaRDI QIDQ955003

Libor Polák, Ondřej Klíma

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.005

zbMATH Keywords

varieties of languagesvarieties of meet automatavarieties of semiring homomorphisms

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Obituary: Libor Polák (1950--2020) ⋮ Coalgebraic constructions of canonical nondeterministic automata ⋮ Shuffle product of regular languages: results and open problems ⋮ Hierarchies of Piecewise Testable Languages ⋮ HIERARCHIES OF PIECEWISE TESTABLE LANGUAGES ⋮ Syntactic structures of regular languages

Cites Work

• Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
• Inference of Reversible Languages
• Mathematical Foundations of Computer Science 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item