Timeline for Help on using the pumping lemma?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 3, 2015 at 19:04 | comment | added | psmears | In fact you can have an even simpler DFA, because the criterion is equivalent to "length of w is even". | |
| Nov 25, 2014 at 2:22 | vote | accept | user24010 | ||
| Nov 21, 2014 at 21:51 | comment | added | David Richerby | The more general point here is that you only need to remember a finite number of things, so you can use the states of a finite automaton to do that. The answer I wrote to a somewhat different question about automata might help you think about designing automata based on what the different states "mean". | |
| Nov 21, 2014 at 21:41 | history | answered | Rick Decker | CC BY-SA 3.0 |