Automatic sequences in negative bases and proofs of some conjectures of shevelev
DOI10.1051/ita/2022011zbMath1527.11022arXiv2208.06025WikidataQ123004016 ScholiaQ123004016MaRDI QIDQ6041046
Unnamed Author, Sonja Linghui Shan, Jeffrey O. Shallit
Publication date: 25 May 2023
Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2208.06025
Thue-Morse sequencelogiccombinatorics on wordsautomatic sequencedecision procedureFibonacci representationrepresentation in negative base
Combinatorics on words (68R15) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Radix representation; digital problems (11A63) Automata sequences (11B85)
Related Items (1)
Cites Work
- On the existence of solutions for the Frenkel-Kontorova models on quasi-crystals
- Synchronized sequences
- A numeration system for Fibonacci-like Wang shifts
- Subword complexity and power avoidance
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Decision algorithms for Fibonacci-automatic Words, I: Basic results
- Differences of Multiple Fibonacci Numbers
- Automatic Sequences
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Automatic sequences in negative bases and proofs of some conjectures of shevelev