Syntactic structures of regular languages

DOI10.1016/j.tcs.2019.10.020zbMath1436.68177arXiv1612.06247OpenAlexW2979916614WikidataQ127031435 ScholiaQ127031435MaRDI QIDQ2333830

Libor Polák, Ondřej Klíma

Publication date: 13 November 2019

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

Full work available at URL: https://arxiv.org/abs/1612.06247

zbMATH Keywords

regular languagessyntactic monoidminimal automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items

Eilenberg's variety theorem without Boolean operations ⋮ On language varieties without Boolean operations ⋮ Minimal state automata for detecting a \(\beta\) globin gene mutation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On varieties of meet automata
• The Birkhoff theorem for finite algebras
• Eilenberg's theorem for positive varieties of languages
• A Reiterman theorem for pseudovarieties of finite first-order structures
• Actions, wreath products of \(\mathcal C\)-varieties and concatenation product.
• Profinite Monads, Profinite Equations, and Reiterman’s Theorem
• Recognisable Languages over Monads
• Duality and Equational Theory of Regular Languages
• Varieties of Languages in a Category
• Semi-galois Categories I
• Stone Duality and the Substitution Principle
• Eilenberg Theorems for Free
• Mathematical Foundations of Computer Science 2004
• Generalized Eilenberg Theorem I: Local Varieties of Languages