1. M. Hall, Combinatorial Theory (Blaisdell, Waltham, MA, 1967); Russian transl.: Combinatorics (Mir, Moscow, 1970).
2. V. I. Nechaev, Elements of Cryptography: Fundamentals of Information Security Theory (Vyssh. Shk., Moscow, 1999) [in Russian].
3. J. Ouaknine and J. Worrell, ‘‘Ultimate positivity is decidable for simple linear recurrence sequences,’’ in Automata, Languages, and Programming, Proc. 41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 2014, Part II, Ed. by J. Esparza et al., Lecture Notes in Computer Science 8573 (Springer, Berlin, 2014), pp. 330–341. https://doi.org/10.1007/978-3-662-43951-7_28
4. G. D. Birkhoff, Dynamical Systems (Am. Math. Soc., Providence, RI, 1966; Regulyar. Khaot. Dinamika, Izhevsk, 1999).
5. E. Hainry, ‘‘Decidability and undecidability in dynamical systems,’’ Research Report (2009). URL: https://hal.inria.fr/inria-00429965