Additive Number Theory via Approximation by Regular Languages

DOI10.1142/S0129054120410014zbMATH Open1467.11011OpenAlexW2798699651MaRDI QIDQ5859643FDOQ5859643

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

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?

zbMATH Keywords

regular languageautomata theoryformal languageadditive basisfinite automatonadditive number theorydecision methodlanguage approximation

Mathematics Subject Classification ID

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

Cites Work

• \textit{Grail}: A C++ library for automata and expressions
• The on-line encyclopedia of integer sequences
• GitHub
• Title not available (Why is that?)
• Automatic Sequences
• Title not available (Why is that?)
• Finding the growth rate of a regular or context-free language in polynomial time
• Elementary Methods in Number Theory
• Title not available (Why is that?)
• On the Diophantine equation $ax^{2t}+bx^ty+cy^2=d$ and pure powers in recurrence sequences.
• On the Recognition of Primes by Automata
• 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
• When is an automatic set an additive basis?

Cited In (3)

• Additive number theory via automata theory
• Sums of Palindromes: an Approach via Automata
• Title not available (Why is that?)

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)