CHAPTER 3 The Relationship Between Finite Automata and Regular Expressions In the previous chapter a finite-state machine was used for describing a language that consists of correct email addresses. However, earlier we also used a regular expression for the same purpose. We also specified the existence of nonregular lan- guages, which cannot be represented by regular