Non-repetitive sequences and Gray code

DOI10.1016/0012-365X(83)90027-4MaRDI QIDQ1168083zbMATH OpenOpenAlexFDO

Authors Helmut Prodinger

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)

Cites work

• 0-1-sequences of Toeplitz type
• A Note on Gray Code and Odd-Even Merge
• Generalizing the Sum of Digits Function
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Infinite 0-1 sequences without long adjacent identical blocks
• Subblock Occurrences in the q-Ary Representation of n

Cited in

(3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1168083)