Timeline for Given two $a^n b^n$-style languages, how do I find out if their intersection is regular?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2017 at 10:51 | vote | accept | Megidd | ||
| May 11, 2017 at 13:17 | comment | added | Raphael | Note that these are not regular expressions; neither of the involved languages is regular! If you don't see why, you need to reread some of your material. | |
| May 11, 2017 at 13:16 | history | edited | Raphael | CC BY-SA 3.0 |
edited title
|
| May 11, 2017 at 3:14 | vote | accept | Megidd | ||
| May 12, 2017 at 10:51 | |||||
| May 11, 2017 at 3:13 | history | edited | Megidd | CC BY-SA 3.0 |
Edited title
|
| May 10, 2017 at 19:51 | history | edited | Raphael |
edited tags
|
|
| May 10, 2017 at 18:09 | answer | added | kntgu | timeline score: 2 | |
| May 10, 2017 at 17:52 | answer | added | PMar | timeline score: 1 | |
| May 10, 2017 at 16:28 | history | asked | Megidd | CC BY-SA 3.0 |