Timeline for answer to How can every regex be accepted by an infinite number of finite automata? by gsz
Current License: CC BY-SA 3.0
Post Revisions
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 17, 2017 at 10:23 | comment | added | David Richerby | @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. | |
| Apr 17, 2017 at 9:54 | comment | added | Chris B | 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. | |
| Apr 17, 2017 at 9:53 | vote | accept | Chris B | ||
| Apr 17, 2017 at 9:04 | review | First posts | |||
| Apr 17, 2017 at 10:50 | |||||
| Apr 17, 2017 at 8:56 | history | answered | gsz | CC BY-SA 3.0 |