Operations on Weakly Recognizing Morphisms
From MaRDI portal
Publication:2829976
DOI10.1007/978-3-319-41114-9_10zbMath1476.68159arXiv1603.05376OpenAlexW2297709294MaRDI QIDQ2829976
Lukas Fleischer, Manfred Kufleitner
Publication date: 9 November 2016
Published in: Descriptional Complexity of Formal Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05376
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On deterministic finite automata and syntactic monoid size
- A proof of Devadze's theorem on generators of the semigroup of Boolean matrices.
- A syntactic congruence for rational \(\omega\)-languages
- Finite automata and unary languages
- Two-generator semigroups of binary relations
- Weak Second‐Order Arithmetic and Finite Automata
- Lower Bounds for Complementation of omega-Automata Via the Full Automata Technique
- Nondeterminism and the size of two way finite automata
This page was built for publication: Operations on Weakly Recognizing Morphisms
