Lecture 9, February 10, 1998. More on automatic sequences.
A sequence is k-automatic iff it is k^n-automatic (Thm. 5.4.2).
If u(n) is k-automatic so is u(an+b) (Thm. 7.1.1). If
u(n) is k-automatic then so is u(n-1) (Thm. 7.1.2).
If u(an+i) is k-automatic for all i, 0 <= i < a, then
u(n) is k-automatic. (Thm. 7.1.4).
There was no class on February 12 due to instructor's illness.
There was no class on February 16 because of Winter study period.