Timeline for Why is the set of all regular expressions classified as context-free, instead of regular?
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 17, 2015 at 17:49 | history | edited | G. Bach | CC BY-SA 3.0 |
added 1 character in body
|
| Nov 17, 2015 at 16:35 | comment | added | Rick Decker | Yeah. As I said, your interpretation of the question was far more interesting than the new version. | |
| Nov 17, 2015 at 16:26 | comment | added | G. Bach | @RickDecker Thanks, maybe it was still useful to someone :) | |
| Nov 17, 2015 at 15:48 | comment | added | Rick Decker | Good answer, but after the OP's clarification, it's no longer relevant. It appears that the question was intended to be "Is the language of regular expressions regular?" to which, of course, the answer is "no". Too bad, since your answer was actually much more interesting, albeit for a different question. | |
| Nov 16, 2015 at 11:48 | history | edited | G. Bach | CC BY-SA 3.0 |
added 31 characters in body
|
| Nov 16, 2015 at 11:46 | history | edited | David Richerby | CC BY-SA 3.0 |
Monotonically, not monotonously.
|
| Nov 16, 2015 at 11:44 | history | edited | G. Bach | CC BY-SA 3.0 |
added 780 characters in body
|
| Nov 16, 2015 at 11:33 | history | answered | G. Bach | CC BY-SA 3.0 |