Timeline for What are regular expressions good for?
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 9, 2011 at 20:31 | comment | added | Jukka Suomela | I wonder if these languages (and their simpler versions, such as summing all digits modulo something) are also natural examples of regular languages that admit a small and simple state machine, but the smallest regular expression is huge... | |
| Oct 9, 2011 at 17:25 | comment | added | David Eppstein | I don't, sorry. It was more a theoretical observation based on the fact that they define regular languages. It might be the case that the corresponding regular expressions are somewhat cumbersome. | |
| Oct 9, 2011 at 10:58 | comment | added | Jukka Suomela | This is a nice example! Do you happen to know a web site or text book that gives a fully worked-out example of a regular expression that implements a real-world check digit algorithm? (I tried to do some googling but only found claims that regular expressions cannot be used for this... :) | |
| Oct 9, 2011 at 2:18 | history | answered | David Eppstein | CC BY-SA 3.0 |