Rudin-Shapiro Sums Via Automata Theory and Logic

02/01/2023
by   Narad Rampersad, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2018

Alternating Nonzero Automata

We introduce a new class of automata on infinite trees called alternatin...
research
08/12/2023

Proving properties of some greedily-defined integer recurrences via automata theory

Venkatachala on the one hand, and Avdispahić Zejnulahi on the other,...
research
09/11/2018

Dynamic logic assigned to automata

A dynamic logic B can be assigned to every automaton A without regard ...
research
09/09/2018

Well Quasiorders and Hierarchy Theory

We discuss some applications of WQOs to several fields were hierarchies ...
research
02/07/2019

A Unified Dissertation on Bearing Rigidity Theory

Accounting for the current state-of-the-art, this work aims at summarizi...
research
02/11/2018

Bimodal logics with contingency and accident

Contingency and accident are two important notions in philosophy and phi...
research
11/20/2018

Identifiers in Registers - Describing Network Algorithms with Logic

We propose a formal model of distributed computing based on register aut...

Please sign up or login with your details

Forgot password? Click here to reset