In The (New) Turing Omnibus by A K Dewdney, chapter 2, it says:
Moreover, for every regular expression there is an automaton which accepts the language symbolized by that expression. Thus, in a sense, regular expressions capture precisely the behavior of automata in terms of the language they accept. However, for every regular expression there are an infinite number of automata which accept that language.
But for a simple regex, e.g.
a, I can think of exactly one finite automaton that corresponds to it:
(start state) -a-> (accepting state). I don't see how there can be an infinite number. What am I missing?
For context, at this point in the book he has not yet introduced DFAs vs NFAs, and all examples of automata so far have been DFAs.