Frobenius Numbers and Automatic Sequences

zbMath1490.11036arXiv2103.10904MaRDI QIDQ3390106

Jeffrey O. Shallit

Publication date: 24 March 2022

Full work available at URL: https://arxiv.org/abs/2103.10904

zbMATH Keywords

automatic sequencesregular sequencesFrobenius numberBeatty sequenceWalnutevil numberoddious number

Mathematics Subject Classification ID

Automata sequences (11B85) The Frobenius problem (11D07)

Related Items (1)

Unnamed Item

Uses Software

• OEIS
• Walnut

Cites Work

• Beyond odious and evil
• On the Frobenius problem for Beatty sequences
• Numerical semigroups.
• Complexity of the Frobenius problem
• Additive number theory via automata theory
• Sumsets associated with Wythoff sequences and Fibonacci numbers
• Synchronized sequences
• The Critical Exponent is Computable for Automatic Sequences
• On synchronized sequences and their separators
• On integers which are representable as sums of large squares
• Automatic Sequences
• ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
• On a linear diophantine problem of Frobenius
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Frobenius Numbers and Automatic Sequences