UNAMBIGUOUS MORPHIC IMAGES OF STRINGS

DOI10.1142/S0129054106004017zbMath1110.68119MaRDI QIDQ5483376

Dominik D. Freydenberger, Johannes C. Schneider, Daniel Reidenbach

Publication date: 14 August 2006

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

ambiguitymorphismscombinatorics on wordspattern languages

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (16)

Ambiguity of Morphisms in a Free Group ⋮ A parameterized study of maximum generalized pattern matching problems ⋮ On the parameterised complexity of string morphism problems ⋮ Regular and context-free pattern languages over small alphabets ⋮ Weakly unambiguous morphisms ⋮ Bad News on Decision Problems for Patterns ⋮ Discontinuities in pattern inference ⋮ Unambiguous erasing morphisms in free monoids ⋮ The unambiguity of segmented morphisms ⋮ Restricted ambiguity of erasing morphisms ⋮ Unambiguous Erasing Morphisms in Free Monoids ⋮ Morphically primitive words ⋮ ON THE DUAL POST CORRESPONDENCE PROBLEM ⋮ Bad news on decision problems for patterns ⋮ Pattern matching with variables: a multivariate complexity analysis ⋮ Unambiguous injective morphisms in free groups

Cites Work

• Unnamed Item
• Unnamed Item
• On a conjecture about finite fixed points of morphisms
• Polynomial-time inference of arbitrary pattern languages
• A non-learnable class of E-pattern languages
• Finding patterns common to a set of strings
• Strongly prime PCP words
• Fixed languages and the adult languages of ol schemest^†
• Language identification in the limit
• A variant of a recursively unsolvable problem

This page was built for publication: UNAMBIGUOUS MORPHIC IMAGES OF STRINGS