Timeline for For which regular expressions $\alpha$ is $\{ \beta \mid L(\alpha) = L(\beta) \}$ PSPACE-complete?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:38 | history | edited | CommunityBot |
Commonmark migration
|
|
| May 12, 2016 at 16:14 | vote | accept | mikero | ||
| May 12, 2016 at 11:52 | answer | added | David | timeline score: 20 | |
| May 12, 2016 at 9:17 | history | tweeted | twitter.com/StackCSTheory/status/730688454720389120 | ||
| May 12, 2016 at 9:17 | comment | added | Emil Jeřábek | What operations are allowed in your regular expressions? Clearly, if you have complement (or rather, symmetric difference), the complexity of the problem is independent of $\alpha$. | |
| May 12, 2016 at 2:58 | history | edited | mikero |
add cc.complexity-theory tag
|
|
| May 12, 2016 at 1:39 | history | asked | mikero | CC BY-SA 3.0 |