Sums of Palindromes: an Approach via Automata
From MaRDI portal
Publication:3304153
DOI10.4230/LIPIcs.STACS.2018.54zbMath1497.68277arXiv1706.10206OpenAlexW2793662473MaRDI QIDQ3304153
No author found.
Publication date: 5 August 2020
Full work available at URL: https://arxiv.org/abs/1706.10206
Combinatorics on words (68R15) Formal languages and automata (68Q45) Additive bases, including sumsets (11B13) Computer assisted proofs of proofs-by-exhaustion type (68V05)
Related Items
Reciprocal Sum of Palindromes, When is an automatic set an additive basis?, Unnamed Item, Combinatorial structure and sumsets associated with Beatty sequences generated by powers of the golden ratio, Additive number theory via automata theory, Longest arithmetic progressions of palindromes, Palindromic Characteristic of Committed Graphs and Some Model Theoretic Properties, Additive Number Theory via Approximation by Regular Languages, Say no to case analysis: automating the drudgery of case-based proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limitations of lower bound methods for deterministic nested word automata
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Nondeterministic state complexity of nested word automata
- Operational state complexity of nested word automata
- Prime divisors of palindromes
- State complexity of operations on input-driven pushdown automata
- Every natural number is the sum of forty-nine palindromes
- Every positive integer is a sum of three palindromes
- Average Value of the Euler Function on Binary Palindromes
- Adding nesting structure to words
- On the Membership Problem for Visibly Pushdown Languages
- Visibly pushdown languages
- The Mystique of Repunits
- A helpful result for proving inherent ambiguity
