Additive Number Theory via Approximation by Regular Languages

DOI10.1142/S0129054120410014MaRDI QIDQ5859643zbMATH OpenOpenAlexFDO

Authors Thomas Lidbetter, Jason P. Bell, Jeffrey 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

additive basisadditive number theoryautomata theorydecision methodfinite automatonformal languagelanguage approximationregular language

Mathematics Subject Classification ID

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

Recommendations

• Sums of Palindromes: an Approach via Automata
• Additive number theory via automata theory
• Additive number theory via approximation by regular languages
• Every natural number is the sum of forty-nine palindromes
• On finite additive 2-bases
• Every positive integer is a sum of three palindromes
• An improved lower bound for finite additive 2-bases
• ADDITIVE BASES AND NIVEN NUMBERS
• When is an automatic set an additive basis?

Cites work

• \textit{Grail}: A C++ library for automata and expressions
• Additive number theory via approximation by regular languages
• Automatic Sequences
• Elementary Methods in Number Theory
• Every natural number is the sum of forty-nine palindromes
• Every positive integer is a sum of three palindromes
• Finding the growth rate of a regular or context-free language in polynomial time
• GitHub
• scientific article; zbMATH DE number 4033111 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 914352 (Why is no real title available?)
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• On the Recognition of Primes by Automata
• Sums of Palindromes: an Approach via Automata
• The on-line encyclopedia of integer sequences
• When is an automatic set an additive basis?

Cited in

(8)

• Additive number theory via approximation by regular languages
• Additive number theory via automata theory
• Sums of Palindromes: an Approach via Automata
• When is an automatic set an additive basis?
• scientific article; zbMATH DE number 2156204 (Why is no real title available?)
• scientific article; zbMATH DE number 4774 (Why is no real title available?)
• Lagrange's theorem for binary squares
• Additive Properties of the Evil and Odious Numbers and Similar Sequences

Describes a project that uses

Uses Software

• Grail
• OEIS
• Walnut
• GitHub

This page was built for publication: Additive Number Theory via Approximation by Regular Languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5859643)