scientific article
From MaRDI portal
Publication:3919722
zbMath0467.05010MaRDI QIDQ3919722
Publication date: 1982
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002199122
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enumerative combinatorics (05A99) Word problems, etc. in computability and recursion theory (03D40) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Related Items (11)
Repetition-free words ⋮ Applications of parallel processors to some hard discrete problems ⋮ On the Tree of Ternary Square-Free Words ⋮ On the structure and extendibility of \(k\)-power 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 ⋮ Partially abelian squarefree words ⋮ Periodicity and the golden ratio
This page was built for publication:
