Timeline for Given L is a regular language, prove that Perm(L) is Context-Free
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 5, 2021 at 22:21 | comment | added | bigbang | Yes, all regular languages defined over $\Sigma = \{0,1\}$ | |
| Apr 5, 2021 at 19:38 | comment | added | Robbie Goodwin | Are you suggesting all languages must follow the same rules? | |
| Apr 1, 2021 at 9:47 | vote | accept | bigbang | ||
| Apr 1, 2021 at 9:47 | vote | accept | bigbang | ||
| Apr 1, 2021 at 9:47 | |||||
| Apr 1, 2021 at 3:04 | history | became hot network question | |||
| Mar 31, 2021 at 20:18 | vote | accept | bigbang | ||
| Apr 1, 2021 at 9:47 | |||||
| Mar 31, 2021 at 19:56 | answer | added | Hendrik Jan | timeline score: 6 | |
| Mar 31, 2021 at 19:54 | answer | added | Yuval Filmus | timeline score: 5 | |
| Mar 31, 2021 at 19:42 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
deleted 2 characters in body
|
| Mar 31, 2021 at 19:04 | history | edited | Steven | CC BY-SA 4.0 |
edited title
|
| Mar 31, 2021 at 19:02 | history | asked | bigbang | CC BY-SA 4.0 |