scientific article; zbMATH DE number 7378335
From MaRDI portal
Publication:5005118
DOI10.4230/LIPIcs.MFCS.2018.18MaRDI QIDQ5005118
Dirk Nowotka, Aayush Rajasekaran, P. Madhusudan, Jeffrey O. Shallit
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1710.04247
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decidable theoryfinite automatonadditive number theorydecision proceduretheorem-provingbinary square
Related Items (3)
Additive number theory via automata theory ⋮ ADDITIVE BASES AND NIVEN NUMBERS ⋮ Say no to case analysis: automating the drudgery of case-based proofs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Waring's Problem
- Elementary Methods in Number Theory
- On the sum of two squares and two powers of k
- Waring's Problem
This page was built for publication: