Rudin-Shapiro Sums Via Automata Theory and Logic.

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Theory of Computing Systems Pub Date : 2025-01-01 Epub Date: 2025-01-24 DOI:10.1007/s00224-025-10214-1

Narad Rampersad, Jeffrey Shallit

引用次数: 0

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.

查看原文本刊更多论文

Rudin-Shapiro基于自动机理论和逻辑的求和。

我们展示了如何通过逻辑和自动机理论提供的统一框架，得到Brillhart和Morton关于Rudin-Shapiro和的许多经典结果。这些技术还有助于对新结果进行简单的证明。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theory of Computing Systems 工程技术-计算机：理论方法

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.