Multidimensional unrepetitive configurations

DOI10.1016/0304-3975(88)90080-1zbMath0649.68073OpenAlexW2043048015WikidataQ64357140 ScholiaQ64357140MaRDI QIDQ1106022

Arturo Carpi

Publication date: 1988

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(88)90080-1

zbMATH Keywords

combinatorics on wordsavoidable patternsr-th power-free words

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete mathematics in relation to computer science (68R99) Designs and configurations (05B99)

Related Items (15)

Dejean's conjecture and Sturmian words ⋮ On minimal critical exponent of balanced sequences ⋮ On avoding \(r\)-repetitions in \(\mathbb R^2\) ⋮ On the minimal alphabet size in multidimensional unrepetitive configurations ⋮ Thue type problems for graphs, points, and numbers ⋮ On square-free arithmetic progressions in infinite words ⋮ Nonrepetitive colorings of line arrangements ⋮ Words avoiding repetitions in arithmetic progressions ⋮ Pattern avoidance: themes and variations ⋮ On the D0L Repetition Threshold ⋮ Every real number greater than 1 is a critical exponent ⋮ Nonrepetitive and pattern-free colorings of the plane ⋮ Avoiding Multiple Repetitions in Euclidean Spaces ⋮ Some further results on squarefree arithmetic progressions in infinite words ⋮ Repetitions in Toeplitz words and the Thue threshold

Cites Work

• Unnamed Item
• Unnamed Item
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Avoidable patterns in strings of symbols
• Uniformly growing k-th power-free homomorphisms
• Sur un théorème de Thue
• Unending chess, symbolic dynamics and a problem in semi-groups
• 2726. A problem on strings of beads

This page was built for publication: Multidimensional unrepetitive configurations