Timeline for How to prove a language is regular?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2013 at 15:59 | comment | added | reinierpost | Yes, it is just a different perspective. | |
| Apr 8, 2013 at 15:57 | history | edited | reinierpost | CC BY-SA 3.0 |
added 13 characters in body
|
| Apr 5, 2013 at 11:37 | comment | added | Raphael | O(1) space, you mean? In any case, this is covered by the fact that DFA suffice; it may be worthwhile to explicitly note this equivalence in terms of programming. | |
| Apr 5, 2013 at 10:48 | history | answered | reinierpost | CC BY-SA 3.0 |