Aperiodic words on three symbols.
From MaRDI portal
Publication:3882467
DOI10.1515/CRLL.1981.321.195zbMATH Open0441.05007OpenAlexW4233592581MaRDI QIDQ3882467FDOQ3882467
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
Enumerative combinatorics (05A99) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Word problems, etc. in computability and recursion theory (03D40)
Cited In (10)
- Chains and fixing blocks in irreducible binary sequences
- Which graphs allow infinite nonrepetitive walks?
- Non-repetitive words: Ages and essences
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\)
- Applying, extending, and specializing pseudorecursiveness
- Periodicity and the golden ratio
- Nonrepetitive colorings of graphs -- a survey
- Growth problems for avoidable words
- Nonrepetitive colorings of trees
- Partially abelian squarefree words
This page was built for publication: Aperiodic words on three symbols.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3882467)