Morphically primitive words
From MaRDI portal
Publication:1019730
DOI10.1016/J.TCS.2009.01.020zbMATH Open1166.68036OpenAlexW1981721733MaRDI QIDQ1019730FDOQ1019730
Authors: Daniel Reidenbach, Johannes Schneider 
Publication date: 28 May 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.lboro.ac.uk/2134/4561
Recommendations
Cites Work
- Title not available (Why is that?)
- Finding patterns common to a set of strings
- The Number of Partitions of a Set
- Title not available (Why is that?)
- UNAMBIGUOUS MORPHIC IMAGES OF STRINGS
- Finding a homomorphism between two words is NP-complete
- Discontinuities in pattern inference
- Decision problems for patterns
- Morphically primitive words
- Fixed languages and the adult languages of ol schemest†
- On a conjecture about finite fixed points of morphisms
- The Unambiguity of Segmented Morphisms
- On Almost Periodicity Criteria for Morphic Sequences in Some Particular Cases
Cited In (28)
- Some operations preserving primitivity of words
- Unambiguous erasing morphisms in free monoids
- A little more about morphic Sturmian words
- Inferring descriptive generalisations of formal languages
- Unambiguous injective morphisms in free groups
- Relative Watson-Crick primitivity of words
- Primitive morphisms
- Existence and nonexistence of descriptive patterns
- Weakly unambiguous morphisms
- Restricted ambiguity of erasing morphisms
- On the robustness of primitive words
- Morphic primitivity and alphabet reductions
- On the dual Post correspondence problem
- The unambiguity of segmented morphisms
- The block structure of successor morphisms
- Title not available (Why is that?)
- The Billaud conjecture for \(|\varSigma| = 4\), and beyond
- On Billaud words and their companions
- On Billaud words and their companions
- Ambiguity of morphisms in a free group
- Periodicity forcing words
- Unambiguous Erasing Morphisms in Free Monoids
- Complexity of testing morphic primitivity
- Existence and Nonexistence of Descriptive Patterns
- Linear-time version of Holub's algorithm for morphic imprimitivity testing
- Title not available (Why is that?)
- Morphically primitive words
- Polynomial-time algorithm for fixed points of nontrivial morphisms
Uses Software
This page was built for publication: Morphically primitive words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1019730)
