2021/10/12 by Narad Rampersad, Jeffrey Shallit, Rampersad, Narad +1
Computer Science · Mathematics · #semigroups and automata theory #Advanced Combinatorial Mathematics #Advanced Algebra and Logic
paper · pdf · doi:10.48550/arxiv.2110.06244
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems about such sequences can therefore be proved using Walnut, which is an implementation of a decision procedure for proving various properties of automatic sequences. In this paper we explore some results (old and new) that can be proved using this method.