Recommendations
Cites work
- A non-learnable class of E-pattern languages
- A variant of a recursively unsolvable problem
- Finding patterns common to a set of strings
- Fixed languages and the adult languages of ol schemest†
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 3943051 (Why is no real title available?)
- Language identification in the limit
- On a conjecture about finite fixed points of morphisms
- Polynomial-time inference of arbitrary pattern languages
- Strongly prime PCP words
Cited in
(16)- Morphically primitive words
- Bad news on decision problems for patterns
- Unambiguous injective morphisms in free groups
- Pattern matching with variables: a multivariate complexity analysis
- On the parameterised complexity of string morphism problems
- Ambiguity of morphisms in a free group
- Bad News on Decision Problems for Patterns
- Unambiguous erasing morphisms in free monoids
- Unambiguous Erasing Morphisms in Free Monoids
- Regular and context-free pattern languages over small alphabets
- Weakly unambiguous morphisms
- On the dual Post correspondence problem
- Developments in Language Theory
- Restricted ambiguity of erasing morphisms
- Discontinuities in pattern inference
- The unambiguity of segmented morphisms
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)
