A General Approach to Proving Properties of Fibonacci Representations via Automata Theory

DOI10.4204/eptcs.386.18arXiv2309.02765OpenAlexW4386399952MaRDI QIDQ6204138

Jeffrey O. Shallit, Sonja Linghui Shan

Publication date: 9 April 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Logic and \(p\)-recognizable sets of integers
• Robbins and Ardila meet Berstel
• An Exercise on Fibonacci Representations
• Decision algorithms for Fibonacci-automatic Words, I: Basic results
• Weak Second‐Order Arithmetic and Finite Automata
• Differences of Multiple Fibonacci Numbers
• The Logical Approach to Automatic Sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A General Approach to Proving Properties of Fibonacci Representations via Automata Theory