Restricted ambiguity of erasing morphisms

DOI10.1016/j.tcs.2011.02.041zbMath1221.68186OpenAlexW2057193484MaRDI QIDQ551171

Johannes C. Schneider, Daniel Reidenbach

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/8395

zbMATH Keywords

ambiguitypattern languageserasing morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (3)

Dynamics of interval maps generated by erasing substitutions ⋮ Mixing properties of erasing interval maps ⋮ Weakly unambiguous morphisms

Cites Work

• Unnamed Item
• Multi-pattern languages
• Discontinuities in pattern inference
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Decision problems for patterns
• Unambiguous erasing morphisms in free monoids
• Restricted Ambiguity of Erasing Morphisms
• Fixed languages and the adult languages of ol schemest^†
• Pattern languages with and without erasing
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

This page was built for publication: Restricted ambiguity of erasing morphisms