ABSTRACT
In Chapter 1 , we introduced finite automata and the languages they recognise. In this chapter we do two things. First, we look at ways of constructing certain kinds of automata. Second, we describe a technique for showing that some languages are not recognisable.
