The unambiguity of segmented morphisms

DOI10.1016/j.dam.2009.06.009zbMath1209.05003OpenAlexW1983893610MaRDI QIDQ967360

Dominik D. Freydenberger, Daniel Reidenbach

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

ambiguitymorphismscombinatorics on wordspattern languages

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Formal languages and automata (68Q45)

Related Items

Ambiguity of Morphisms in a Free Group, Weakly unambiguous morphisms, Unambiguous injective morphisms in free groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a conjecture about finite fixed points of morphisms
• Finding a homomorphism between two words is NP-complete
• A non-learnable class of E-pattern languages
• Growth problems for avoidable words
• Developments from enquiries into the learnability of the pattern languages from positive data
• Discontinuities in pattern inference
• Morphically primitive words
• Decision problems for patterns
• Strongly prime PCP words
• Extension of the decidability of the marked PCP to instances with unique blocks
• Fixed languages and the adult languages of ol schemest^†
• The Unambiguity of Segmented Morphisms
• UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
• A variant of a recursively unsolvable problem