Timeline for Closure of regular languages under interchanging two different letters
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 8, 2021 at 15:56 | history | edited | Yuval Filmus | edited tags | |
| Apr 5, 2021 at 19:22 | comment | added | Yuval Filmus | Your approach doesn't work, since the original language could be infinite, while your automaton requires $\binom{n}{2}$ states to handle words of length $n$. | |
| Apr 5, 2021 at 19:22 | history | edited | Yuval Filmus | CC BY-SA 4.0 | added 61 characters in body; edited tags; edited title |
| Apr 5, 2021 at 19:19 | answer | added | Yuval Filmus | timeline score: 1 | |
| Apr 5, 2021 at 18:42 | history | asked | Curious student | CC BY-SA 4.0 |