ABSTRACT
In Chapter 5, we showed how to construct an e-automaton A from a regular expression r. To complete this process, and find a deterministic automaton recognising L(r), we need to convert A into a non-deterministic automaton and then apply the accessible subset construction. The main aim of this chapter is to show how to construct a non-deterministic automaton directly from the regular expression r.
