When is an automatic set an additive basis?
Jason Bell, Kathryn Hare, Jeffrey Shallit

TL;DR
This paper characterizes when k-automatic sets of natural numbers form additive bases, providing an effective characterization and an algorithm to determine the minimal order of such bases.
Contribution
It offers a complete characterization and an algorithmic method to identify when k-automatic sets are additive bases and to find their minimal order.
Findings
Characterization of k-automatic additive bases
Effective criteria for identifying additive bases
Algorithm to compute the minimal order of the basis
Abstract
We characterize those -automatic sets of natural numbers that form an additive basis for the natural numbers, and we show that this characterization is effective. In addition, we give an algorithm to determine the smallest such that forms an additive basis of order , if it exists.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
