Title:  Decision problems on automatic sequences

A sequence (a_n) is said to be k-automatic if there is a finite-state machine that, after processing the input string of n expressed in base k, ends in a state with output a_n.

In this talk I sketch a decision procedure and its implementation for answering many questions about such sequences; questions such as Is the sequence square free? Is the sequence recurrent? A number of open problems will be presented and discussed.