Weakly unambiguous morphisms

DOI10.1016/j.tcs.2012.04.045zbMath1258.68108OpenAlexW2121658477MaRDI QIDQ442106

Dominik D. Freydenberger, Hossein Nevisi, Daniel Reidenbach

Publication date: 9 August 2012

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.04.045

zbMATH Keywords

ambiguitynonerasing morphisms

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (1)

ON THE DUAL POST CORRESPONDENCE PROBLEM

Cites Work

• Restricted ambiguity of erasing morphisms
• A non-learnable class of E-pattern languages
• Discontinuities in pattern inference
• The unambiguity of segmented morphisms
• Morphically primitive words
• Polynomial-time algorithm for fixed points of nontrivial morphisms
• Unambiguous erasing morphisms in free monoids
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weakly unambiguous morphisms