Complexity of linear subsequences of Fibonacci-automatic sequences

DOI10.1007/978-3-032-28404-4_14MaRDI QIDQ7356298zbMATH OpenFDO

Authors Delaram Moradi, Narad Rampersad, Jeffrey Shallit

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28404-4_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• Automatic Sequences
• Constructing morphisms for arithmetic subsequences of Fibonacci
• Decision algorithms for Fibonacci-automatic words. I: Basic results.
• Fast brief practical DFA minimization
• scientific article; zbMATH DE number 3947643 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (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?)
• Logic and p-recognizable sets of integers
• Redundancy of minimal weight expansions in Pisot bases
• The Logical Approach to Automatic Sequences
• The minimal automaton recognizing m N in a linear numeration system

This page was built for publication: Complexity of linear subsequences of Fibonacci-automatic sequences

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