Skip to main content

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

2
  • $\begingroup$ Thank you. I was being silly and thinking about automata that accept only the given regex, which is not what the book said at all. $\endgroup$ Commented Apr 17, 2017 at 9:54
  • 3
    $\begingroup$ @ChrisB No, now you're being silly. :-) When we say that an automaton accepts some language, we mean that it accepts exactly that language, and rejects all strings not in that langauge. So the construction given in the final sentence here isn't quite correct, since an automaton with only one transition from the start state to a unique accepting state could accept almost any language. $\endgroup$ Commented Apr 17, 2017 at 10:23