Unambiguous Erasing Morphisms in Free Monoids
From MaRDI portal
Publication:3599095
DOI10.1007/978-3-540-95891-8_43zbMath1206.68198OpenAlexW1512158324MaRDI QIDQ3599095
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=ITA_2010__44_2_193_0/
Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)
Related Items
Cites Work
- Unnamed Item
- Finding a homomorphism between two words is NP-complete
- A non-learnable class of E-pattern languages
- Discontinuities in pattern inference
- Morphically primitive words
- Decision problems for patterns
- Fixed languages and the adult languages of ol schemest†
- The Unambiguity of Segmented Morphisms
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS