ABSTRACT
The aim of this chapter is to set out the basic definitions and ideas we shall use throughout this book. In particular, we explain what we mean by a finite automaton and the language recognised by a finite automaton. Background results from discrete mathematics are outlined in the Appendix.
