Additive number theory via automata theory
From MaRDI portal
Publication:1987517
DOI10.1007/s00224-019-09929-9zbMath1475.11040OpenAlexW2947749495WikidataQ127811653 ScholiaQ127811653MaRDI QIDQ1987517
Publication date: 15 April 2020
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-019-09929-9
automata theorypalindromeadditive number theorydecision procedureformal language theoryvisibly pushdown automatonautomated proof
Formal languages and automata (68Q45) Radix representation; digital problems (11A63) Automata sequences (11B85)
Related Items (11)
Sumsets and fixed points of substitutions ⋮ Computational aspects of sturdy and flimsy numbers ⋮ Frobenius Numbers and Automatic Sequences ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the boundary sequence of an automatic sequence ⋮ Unnamed Item ⋮ Sumsets of Wythoff sequences, Fibonacci representation, and beyond ⋮ ADDITIVE BASES AND NIVEN NUMBERS ⋮ ON A -ADDITIVE UNIQUENESS SET FOR MULTIPLICATIVE FUNCTIONS ⋮ 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability
- Palindromes in linear recurrence sequences
- Limitations of lower bound methods for deterministic nested word automata
- On binary palindromes of the form \(10^n\pm 1\)
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Logic and \(p\)-recognizable sets of integers
- Solution of the Robbins problem
- Bertrand numeration systems and recognizability
- Palindromes in Lucas sequences
- Additive number theory via approximation by regular languages
- Sum of digits and distribution in congruence classes for palindromes with missing digits
- Almost all palindromes are composite.
- Periodicity, repetitions, and orbits of an automatic sequence
- Nondeterministic state complexity of nested word automata
- Operational state complexity of nested word automata
- Waring's theorem for binary powers
- Prime divisors of palindromes
- State complexity of operations on input-driven pushdown automata
- Every natural number is the sum of forty-nine palindromes
- ON d-DIGIT PALINDROMES IN DIFFERENT BASES: THE NUMBER OF BASES IS UNBOUNDED
- Automatic Theorem-Proving in Combinatorics on Words
- ON "VERY PALINDROMIC" SEQUENCES
- Discriminators and k-Regular Sequences
- Decision Algorithms for Fibonacci-Automatic Words, III: Enumeration and Abelian Properties
- Every positive integer is a sum of three palindromes
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Weak Second‐Order Arithmetic and Finite Automata
- Sums of Palindromes: an Approach via Automata
- Palindromes in Different Bases: A Conjecture of J. Ernest Wilkins
- 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
- Palindromes dans les progressions arithmétiques
- The Mystique of Repunits
- When is an automatic set an additive basis?
- Number Theory for the Millennium III
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCES
- On the Number of Unbordered Factors
- Primitive Words and Lyndon Words in Automatic and Linearly Recurrent Sequences
- Decidability and Enumeration for Automatic Sequences: A Survey
- On Simultaneous Palindromes
- Subword Complexity and k-Synchronization
- A helpful result for proving inherent ambiguity
This page was built for publication: Additive number theory via automata theory
