Analysis of an Infinite Product Algorithm

DOI10.1137/0402001MaRDI QIDQ3833613zbMATH OpenOpenAlexFDO

Authors Jean-Paul Allouche, Péter Hajnal, Jeffrey Shallit

Publication date 1989

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0402001

zbMATH Keywords

bifix-free wordsbinary wordscomplexity of algorithminfinite productstrees

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Infinite Products Associated with Counting Blocks in Binary Strings
• Patterns in numbers and infinite sums and products
• An Explicit Formula of Subblock Occurrences for the p-Adic Expansion
• Two infinite words with cubic subword complexity
• scientific article; zbMATH DE number 4120241
• A new infinite product representation for real numbers
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• On an arithmetic function.
• A note on divisibility sequences.
• Dirichlet Series and Curious infinite Products

Cited in

(4)

• Infinite Products Associated with Counting Blocks in Binary Strings
• PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES
• Kempner-like Harmonic Series
• Patterns in numbers and infinite sums and products

This page was built for publication: Analysis of an Infinite Product Algorithm

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