Aperiodic words on three symbols. II.

DOI10.1515/crll.1981.327.1zbMath0455.05014OpenAlexW3081952542MaRDI QIDQ3903011

Robert O. Shelton

Publication date: 1981

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002198738

zbMATH Keywords

perfect setsquare-free words

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Enumerative combinatorics (05A99) Word problems, etc. in computability and recursion theory (03D40) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (7)

Applications of parallel processors to some hard discrete problems ⋮ On the Tree of Ternary Square-Free Words ⋮ Which graphs allow infinite nonrepetitive walks? ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ Growth problems for avoidable words ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Chains and fixing blocks in irreducible binary sequences

This page was built for publication: Aperiodic words on three symbols. II.