UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
From MaRDI portal
Publication:5483376
DOI10.1142/S0129054106004017zbMATH Open1110.68119MaRDI QIDQ5483376FDOQ5483376
Dominik D. Freydenberger, Johannes Schneider, Daniel Reidenbach
Publication date: 14 August 2006
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Recommendations
Cites Work
- Language identification in the limit
- Finding patterns common to a set of strings
- A variant of a recursively unsolvable problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A non-learnable class of E-pattern languages
- Polynomial-time inference of arbitrary pattern languages
- Fixed languages and the adult languages of ol schemest†
- On a conjecture about finite fixed points of morphisms
- Strongly prime PCP words
Cited In (17)
- Unambiguous erasing morphisms in free monoids
- Developments in Language Theory
- Ambiguity of Morphisms in a Free Group
- Pattern matching with variables: a multivariate complexity analysis
- ON THE DUAL POST CORRESPONDENCE PROBLEM
- Unambiguous injective morphisms in free groups
- Bad News on Decision Problems for Patterns
- A parameterized study of maximum generalized pattern matching problems
- Weakly unambiguous morphisms
- Restricted ambiguity of erasing morphisms
- On the parameterised complexity of string morphism problems
- Discontinuities in pattern inference
- The unambiguity of segmented morphisms
- Regular and context-free pattern languages over small alphabets
- Unambiguous Erasing Morphisms in Free Monoids
- Bad news on decision problems for patterns
- Morphically primitive words
This page was built for publication: UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5483376)
