6533b857fe1ef96bd12b432b
RESEARCH PRODUCT
Some Decision Results on Nonrepetitive Words
Sergio SalemiAntonio Restivosubject
PrefixCombinatoricsTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESComputer Science::Discrete MathematicsUnique factorization domainComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Square-free integerComputer Science::Formal Languages and Automata TheoryBinary alphabetWord (computer architecture)Mathematicsdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 1985-01-01 |