Constructing morphisms for arithmetic subsequences of Fibonacci

DOI10.1007/978-3-031-61716-4_6MaRDI QIDQ7030788zbMATH OpenFDO

Authors Wieb Bosma, Henk Don

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-61716-4_6

zbMATH Keywords

automataFibonaccimorphic sequences

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• Automatic Sequences
• Complexity of automatic sequences
• Fibonacci and Lucas numbers with applications. Volume I
• Fibonacci Series Modulo m
• Fixed points of the order of appearance in the Fibonacci sequence
• scientific article; zbMATH DE number 1688349 (Why is no real title available?)
• scientific article; zbMATH DE number 3526750 (Why is no real title available?)
• Iteration of maps by an automaton
• Sharper upper bounds for the order of appearance in the Fibonacci sequence
• The Logical Approach to Automatic Sequences
• The minimal automaton recognizing m N in a linear numeration system
• Two-block substitutions and morphic words

This page was built for publication: Constructing morphisms for arithmetic subsequences of Fibonacci

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