Non-repetitive sequences and Gray code

DOI10.1016/0012-365X(83)90027-4zbMath0492.68058OpenAlexW2083133730MaRDI QIDQ1168083

Prodinger, Helmut

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90027-4

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Discrete mathematics in relation to computer science (68R99)

Related Items (3)

Distribution of the sum-of-digits function of random integers: a survey ⋮ The ring of \(k\)-regular sequences ⋮ Gray codes for reflection groups

Cites Work

• Unnamed Item
• Infinite 0-1 sequences without long adjacent identical blocks
• Subblock Occurrences in the q-Ary Representation of n
• A Note on Gray Code and Odd-Even Merge
• Generalizing the Sum of Digits Function
• 0-1-sequences of Toeplitz type

This page was built for publication: Non-repetitive sequences and Gray code