Presents a general approach to studying sequences generated by a finite device. Haeseler (Katholieke Universiteit Leuven, Belgium) first introduces the concepts of substitution on the space of sequences, expanding group endomorphisms, and the kernel graph of a sequence. The main part of the book develops an algorithm for constructing a minimal automaton for a given automatic sequence, investigates the properties of H-automatic sequences and sequences generated by substitutions, and considers the solution of Mahler equations

Скачать книгу бесплатно (pdf, 1.07 Mb)

---

Читать «Automatic Sequences»