Automatic sequences arise naturally in various contexts. The study of automatic sequences lies at the interface of number theory, combinatorics on words, dynamic system, logic and theoretical computer science. In this talk I will first give several equivalent definitions and classical examples of automatic sequences. Then I will present important theorems in this domain. Finally I will talk about our works related to infinite products, completely multiplicative functions, transcendence in positive characteristics, and coefficient extraction.