Restricted ambiguity of erasing morphisms

DOI10.1016/J.TCS.2011.02.041MaRDI QIDQ551171zbMATH OpenOpenAlexFDO

Authors Daniel Reidenbach, Johannes Schneider

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

ambiguityerasing morphismspattern languages

Mathematics Subject Classification ID

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

Recommendations

• Restricted ambiguity of erasing morphisms
• Unambiguous Erasing Morphisms in Free Monoids
• Unambiguous erasing morphisms in free monoids
• The unambiguity of segmented morphisms
• Ambiguity of morphisms in a free group

Cites work

• Decision problems for patterns
• Discontinuities in pattern inference
• Fixed languages and the adult languages of ol schemest^†
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Morphically primitive words
• Multi-pattern languages
• Pattern languages with and without erasing
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Restricted ambiguity of erasing morphisms
• Unambiguous erasing morphisms in free monoids
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

Cited in

(6)

• Dynamics of interval maps generated by erasing substitutions
• Ambiguity of morphisms in a free group
• Restricted ambiguity of erasing morphisms
• Unambiguous Erasing Morphisms in Free Monoids
• Weakly unambiguous morphisms
• Mixing properties of erasing interval maps

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551171)