Aperiodic words on three symbols.

DOI10.1515/crll.1981.321.195zbMath0441.05007OpenAlexW4233592581MaRDI QIDQ3882467

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=GDZPPN002198088

zbMATH Keywords

sequenceschain-like isolated pointL-fixed

Mathematics Subject Classification ID

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

Related Items (10)

A ternary square-free sequence avoiding factors equivalent to \(abcacba\) ⋮ Which graphs allow infinite nonrepetitive walks? ⋮ Nonrepetitive colorings of trees ⋮ Non-repetitive words: Ages and essences ⋮ Applying, extending, and specializing pseudorecursiveness ⋮ Growth problems for avoidable words ⋮ Nonrepetitive colorings of graphs -- a survey ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ Partially abelian squarefree words ⋮ Periodicity and the golden ratio

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