Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
From MaRDI portal
Publication:3014933
DOI10.1007/978-3-642-21493-6_6zbMath1307.68045OpenAlexW2235689614MaRDI QIDQ3014933
Andreas Krebs, Stephanie Reifferscheid, Christoph Behle
Publication date: 8 July 2011
Published in: Algebraic Informatics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21493-6_6
Related Items (4)
A positive extension of Eilenberg's variety theorem for non-regular languages ⋮ Linear circuits, two-variable logic and weakly blocked monoids ⋮ ``Most of leads to undecidability: failure of adding frequencies to LTL ⋮ The algebraic theory of Parikh automata
Cites Work
- Non-uniform automata over groups
- The kernel of monoid morphisms
- Regular languages in \(NC\)
- First-order definability on finite structures
- On uniformity within \(NC^ 1\)
- Characterizing \(\text{TC}^{0}\) in terms of infinite groups
- Parity, circuits, and the polynomial-time hierarchy
- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids
- A logic for constant-depth circuits
- Languages that Capture Complexity Classes
- Algebraic and topological theory of languages
- Some results onC-varieties
- Logic Meets Algebra: the Case of Regular Languages
- On finite monoids having only trivial subgroups
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Typed Monoids – An Eilenberg-Like Theorem for Non Regular Languages
