On the structure and extendibility of \(k\)-power free words
type: Item
instance of: scholarly article
title: On the structure and extendibility of \(k\)-power free words
zbMATH Open document ID: 0824.68094
DOI: 10.1016/0195-6698(95)90051-9
author: James D. Currie
published in: European Journal of Combinatorics
publication date: 1995-05-30T00:00:00Z
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 759650
zbMATH Keywords: free words
MaRDI profile type: Publication
full work available at URL: 0195-6698(95)90051-9
OpenAlex ID: W2021093608
cites work: Q5767794
cites work: Growth problems for avoidable words
cites work: Avoidable patterns in strings of symbols
cites work: NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
cites work: Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
cites work: Embedding the dual of \(\Pi^\infty\) in the lattice of equational classes of semigroups.
cites work: Which graphs allow infinite nonrepetitive walks?
cites work: Open Problems in Pattern Avoidance
cites work: Non-repetitive words: Ages and essences
cites work: Strongly non-repetitive sequences and progression-free sets
cites work: Sur un théorème de Thue
cites work: On nonrepetitive sequences
cites work: Binary Sequences which Contain no BBb
cites work: A Transformation with Simple Spectrum which is not Rank One
cites work: Characterization of the repetitive commutative semigroups
cites work: On cube-free \(\omega\)-words generated by binary morphisms
cites work: Abelian squares are avoidable on 4 letters
cites work: Infinite words with linear subword complexity
cites work: Q5646912
cites work: Q3919722
cites work: BLOCKING SETS OF TERMS
description: scientific article; zbMATH DE number 759650