Timeline for For two regular languages, why is the set of words from one that don't have a subsequence in the other also regular?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 15, 2014 at 11:10 | history | edited | Raphael | CC BY-SA 3.0 |
edited title
|
| Sep 15, 2014 at 9:32 | history | edited | FrankW |
edited tags
|
|
| Sep 14, 2014 at 18:36 | vote | accept | David Smith | ||
| Sep 14, 2014 at 9:04 | history | tweeted | twitter.com/#!/StackCompSci/status/511078078827601920 | ||
| Sep 13, 2014 at 22:33 | history | edited | David Richerby | CC BY-SA 3.0 |
Simpler statements of definitions.
|
| Sep 13, 2014 at 22:26 | answer | added | D.W.♦ | timeline score: 3 | |
| Sep 13, 2014 at 22:23 | history | edited | D.W.♦ | CC BY-SA 3.0 |
Add a tag. Fix a typo.
|
| Sep 13, 2014 at 22:20 | review | First posts | |||
| Sep 13, 2014 at 22:33 | |||||
| Sep 13, 2014 at 22:19 | history | asked | David Smith | CC BY-SA 3.0 |