A positive extension of Eilenberg's variety theorem for non-regular languages
From MaRDI portal
Publication:2666961
DOI10.1007/s00200-020-00414-2OpenAlexW2999271293MaRDI QIDQ2666961
Publication date: 23 November 2021
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00414-2
Formal languages and automata (68Q45) Varieties and pseudovarieties of semigroups (20M07) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Formations of finite monoids and formal languages: Eilenberg's variety theorem revisited.
- The algebraic theory of Parikh automata
- Shuffle on positive varieties of languages
- Eilenberg's theorem for positive varieties of languages
- Characterizing \(\text{TC}^{0}\) in terms of infinite groups
- Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
- GENERALIZED CONTEXTS AND n-ARY SYNTACTIC SEMIGROUPS OF TREE LANGUAGES
- Some results onC-varieties
- Eilenberg Theorems for Free
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item