Unambiguous erasing morphisms in free monoids
From MaRDI portal
Publication:3566348
DOI10.1051/ita/2009020zbMath1203.68132OpenAlexW2170353776MaRDI QIDQ3566348
Publication date: 7 June 2010
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/44604
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
- Unambiguous Erasing Morphisms in Free Monoids
- Fixed languages and the adult languages of ol schemest†
- The Unambiguity of Segmented Morphisms
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS