scientific article; zbMATH DE number 3976386
From MaRDI portal
Publication:3741097
[For the entire collection see Zbl 0564.00027.] The paper addresses some generalizations of the Thue problem such as: given a word u, does there exist an infinite nonrepetitive overlap free (or square free) word having u as a prefix ? A solution to this as well as to related problems is given for the case of overlap free words on a binary alphabet.
Recommendations
Cited in
(12)- Repetition-free words
- Enumeration of irreducible binary words
- Subword complexity and power avoidance
- Avoiding square-free words on free groups
- Strongly qth Power–Free Strings
- On the tree of ternary square-free words
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters
- Avoiding squares over words with lists of size three amongst four symbols
- Non-repetitive strings over alphabet lists
- Physical oceanography, a mathematical introduction with MATLAB, by Reza Malek-Madani
- Transition property for cube-free words
- Non-repetitive words relative to a rewriting system
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3741097)