https://orcid.org/0000-0001-9466-6898
References
- J.-P. Allouche and J. Shallit, The ubiquitous Prouhet–Thue–Morse sequence, in Sequences and Their Applications, Ding C., Helleseth T., and Niederreiter H., eds., Springer, London, 1998. pp. 1–16.
- J.-P. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
- M. Anđelić, Z. Du, C. da Fonseca, and E. Kılıç, A matrix approach to some second-order difference equations with sign-alternating coefficients, J. Differ. Equ. Appl. 26 (2020), pp. 1–14.
- G. Christol, Ensembles presque périodiques k-reconnaissables, Theor. Comput. Sci. 9 (1979), pp. 141–145.
- A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata, Math. Syst. Theory 3(2) (1969), pp. 186–192.
- H. Furstenberg, Noncommuting random products, Trans. Am. Math. Soc. 108 (1963), pp. 377–428.
- T. Koshy, Fibonacci and Lucas Numbers with Applications, Wiley, Hoboken, 2001.
- E. Makover and J. McGowan, An elementary proof that random Fibonacci sequences grow exponentially, J. Number Theory 121 (2005), pp. 40–44.
- K. McLellan, Periodic coefficients and random Fibonacci sequences, Electron. J. Comb. 20 (2013), pp. P32.
- K. Nishioka, Mahler Functions and Transcendence, Lecture Notes in Mathematics Vol. 1631, Bulletin of The London Mathematical Society, London, 1996.
- J. Shallit, Personal communication, 5th October 2021
- P. Trojovský, On a difference equation of the second order with an exponential coefficient, J. Differ. Equ. Appl. 23 (2017), pp. 1737–1746.
- D. Viswanath, Random Fibonacci sequences and the number 1.13198824, Math. Comput. 69 (2000), pp. 1131–1156.
- D.D. Wall, Fibonacci series modulo m, Am. Math. Mon. 67 (1960), pp. 525–532.