Rudin-Shapiro Sums via Automata Theory and Logic
From MaRDI portal
Publication:6134877
DOI10.1007/978-3-031-33180-0_18arXiv2302.00405OpenAlexW4381304603MaRDI QIDQ6134877FDOQ6134877
Narad Rampersad, Jeffrey Shallit
Publication date: 25 July 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: We show how to obtain, via a unified framework provided by logic and automata theory, many classical results of Brillhart and Morton on Rudin-Shapiro sums. The techniques also facilitate easy proofs for new results.
Full work available at URL: https://arxiv.org/abs/2302.00405
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniform tag sequences
- Finite automata in number theory
- On the base-dependence of sets of numbers recognizable by finite automata
- Some Theorems on Fourier Coefficients
- On sums of Rudin-Shapiro coefficients. II
- Über Summen von Rudin-Shapiroschen Koeffizienten
- On synchronized sequences and their separators
- A Case Study in Mathematical Research: The Golay-Rudin-Shapiro Sequence
- Some properties of a Rudin-Shapiro-like sequence
- Dimension des courbes planes, papiers plies et suites de Rudin-Shapiro
- Paper folding, space-filling curves and Rudin-Shapiro sequences
- Folds!
- Prime numbers along Rudin-Shapiro sequences
- Gowers norms for the Thue-Morse and Rudin-Shapiro sequences
- Synchronized sequences
- The Logical Approach to Automatic Sequences
- Rudin-Shapiro Sums via Automata Theory and Logic
Cited In (3)
This page was built for publication: Rudin-Shapiro Sums via Automata Theory and Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134877)
