Decision algorithms for Fibonacci-automatic Words, I: Basic results
RAIRO-Theor. Inf. Appl., 50 1 (2016) 39-66
Published online: 2016-06-02
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
15981 237 (2026)
https://doi.org/10.1007/978-3-032-02602-6_17
Prefixes of the Fibonacci word
Jeffrey ShallitTheoretical Computer Science 1072 115876 (2026)
https://doi.org/10.1016/j.tcs.2026.115876
The Hurt-Sada Array and Zeckendorf Representations
Jeffrey ShallitThe Fibonacci Quarterly 1 (2026)
https://doi.org/10.1080/00150517.2025.2551839
Beatty sequences for a quadratic irrational: Decidability and applications
Luke Schaeffer, Jeffrey Shallit and Stefan ZorcicDiscrete Mathematics 349 (9) 115183 (2026)
https://doi.org/10.1016/j.disc.2026.115183
Automatic proofs in combinatorial game theory
Bastien Mignoty, Antoine Renard, Michel Rigo and Markus A. WhitelandInternational Journal of Game Theory 54 (2) (2025)
https://doi.org/10.1007/s00182-025-00953-3
14739 3 (2024)
https://doi.org/10.1007/978-3-031-63498-7_1
15015 35 (2024)
https://doi.org/10.1007/978-3-031-71112-1_3
A Fibonacci analogue of the two’s complement numeration system
Sébastien Labbé and Jana LepšováRAIRO - Theoretical Informatics and Applications 57 12 (2023)
https://doi.org/10.1051/ita/2023007
The additive structure of integers with the lower Wythoff sequence
Mohsen Khani and Afshin ZareiArchive for Mathematical Logic 62 (1-2) 225 (2023)
https://doi.org/10.1007/s00153-022-00846-2
Prefixes of the Fibonacci word that end with a cube
Narad RampersadComptes Rendus. Mathématique 361 (G1) 323 (2023)
https://doi.org/10.5802/crmath.408
Properties of a ternary infinite word
James Currie, Pascal Ochem, Narad Rampersad and Jeffrey ShallitRAIRO - Theoretical Informatics and Applications 57 1 (2023)
https://doi.org/10.1051/ita/2022010
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
Jeffrey Shallit and Sonja Linghui ShanElectronic Proceedings in Theoretical Computer Science 386 228 (2023)
https://doi.org/10.4204/EPTCS.386.18
Automatic sequences in negative bases and proofs of some conjectures of shevelev
Jeffrey Shallit, Sonja Linghui Shan and Kai Hsiang YangRAIRO - Theoretical Informatics and Applications 57 4 (2023)
https://doi.org/10.1051/ita/2022011
Note on a Fibonacci parity sequence
Jeffrey ShallitCryptography and Communications 15 (2) 309 (2023)
https://doi.org/10.1007/s12095-022-00592-5
Sumsets of Wythoff sequences, Fibonacci representation, and beyond
Jeffrey ShallitPeriodica Mathematica Hungarica 84 (1) 37 (2022)
https://doi.org/10.1007/s10998-021-00390-1
Automatic winning shifts
Jarkko Peltomäki and Ville SaloInformation and Computation 285 104883 (2022)
https://doi.org/10.1016/j.ic.2022.104883
Ostrowski-automatic sequences: Theory and applications
Aseem Baranwal, Luke Schaeffer and Jeffrey ShallitTheoretical Computer Science 858 122 (2021)
https://doi.org/10.1016/j.tcs.2021.01.018
Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture
Jeffrey ShallitIndagationes Mathematicae 32 (3) 729 (2021)
https://doi.org/10.1016/j.indag.2021.03.004
An Inequality for the Number of Periods in a Word
Daniel Gabric, Narad Rampersad and Jeffrey ShallitInternational Journal of Foundations of Computer Science 32 (05) 597 (2021)
https://doi.org/10.1142/S0129054121410094
On prefix palindromic length of automatic words
Anna E. Frid, Enzo Laborde and Jarkko PeltomäkiTheoretical Computer Science 891 13 (2021)
https://doi.org/10.1016/j.tcs.2021.08.016
Additive Number Theory via Automata Theory
Aayush Rajasekaran, Jeffrey Shallit and Tim SmithTheory of Computing Systems 64 (3) 542 (2020)
https://doi.org/10.1007/s00224-019-09929-9
Critical exponents of infinite balanced words
Narad Rampersad, Jeffrey Shallit and Élise VandommeTheoretical Computer Science 777 454 (2019)
https://doi.org/10.1016/j.tcs.2018.10.017
11682 80 (2019)
https://doi.org/10.1007/978-3-030-28796-2_6
The number of valid factorizations of Fibonacci prefixes
Pierre Bonardo, Anna E. Frid and Jeffrey ShallitTheoretical Computer Science 775 68 (2019)
https://doi.org/10.1016/j.tcs.2018.12.016
The numbers of repeated palindromes in the Fibonacci and Tribonacci words
Yuke Huang and Zhiying WenDiscrete Applied Mathematics 230 78 (2017)
https://doi.org/10.1016/j.dam.2017.06.012
Decision algorithms for Fibonacci-automatic words, II: Related sequences and avoidability
Chen Fei Du, Hamoon Mousavi, Eric Rowland, Luke Schaeffer and Jeffrey ShallitTheoretical Computer Science 657 146 (2017)
https://doi.org/10.1016/j.tcs.2016.10.005
Deciding game invariance
Eric Duchêne, Aline Parreau and Michel RigoInformation and Computation 253 127 (2017)
https://doi.org/10.1016/j.ic.2017.01.010
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Julien Leroy, Michel Rigo and Manon StipulantiDiscrete Mathematics 340 (5) 862 (2017)
https://doi.org/10.1016/j.disc.2017.01.003
Decision algorithms for Fibonacci-automatic Words, I: Basic results
Hamoon Mousavi, Luke Schaeffer and Jeffrey ShallitRAIRO - Theoretical Informatics and Applications 50 (1) 39 (2016)
https://doi.org/10.1051/ita/2016010