Additive Number Theory via Approximation by Regular Languages

DOI10.1142/S0129054120410014zbMath1467.11011OpenAlexW2798699651MaRDI QIDQ5859643

Thomas F. Lidbetter, Jason P. Bell, Jeffrey O. Shallit

Publication date: 19 April 2021

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054120410014

zbMATH Keywords

automata theoryregular languagefinite automatonadditive number theoryformal languageadditive basisdecision methodlanguage approximation

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Additive bases, including sumsets (11B13) Automata sequences (11B85)

Uses Software

• Grail
• OEIS
• GitHub
• Walnut

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• GitHub
• \textit{Grail}: A C++ library for automata and expressions
• Additive number theory via approximation by regular languages
• Every natural number is the sum of forty-nine palindromes
• Every positive integer is a sum of three palindromes
• Sums of Palindromes: an Approach via Automata
• FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• Automatic Sequences
• The on-line encyclopedia of integer sequences
• When is an automatic set an additive basis?
• Elementary Methods in Number Theory
• On the Recognition of Primes by Automata