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

DOI10.4204/EPTCS.386.18MaRDI QIDQ6204138zbMATH OpenOpenAlexFDO

Authors Jeffrey 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

• An Exercise on Fibonacci Representations
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Differences of multiple Fibonacci numbers
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 58834 (Why is no real title available?)
• scientific article; zbMATH DE number 510634 (Why is no real title available?)
• scientific article; zbMATH DE number 913231 (Why is no real title available?)
• scientific article; zbMATH DE number 3203892 (Why is no real title available?)
• scientific article; zbMATH DE number 3332623 (Why is no real title available?)
• scientific article; zbMATH DE number 3373767 (Why is no real title available?)
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• scientific article; zbMATH DE number 3076700 (Why is no real title available?)
• scientific article; zbMATH DE number 7663612 (Why is no real title available?)
• Logic and p-recognizable sets of integers
• Robbins and Ardila meet Berstel
• The Logical Approach to Automatic Sequences
• Weak Second‐Order Arithmetic and Finite Automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6204138)