Timeline for Proving that the language $\{ w^n\mid w \in \{0,1\}^∗, \, n \ge 2 \}$ is not regular
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 18, 2021 at 6:01 | history | edited | Yuval Filmus | CC BY-SA 4.0 |
added 10 characters in body; edited tags
|
| Apr 13, 2021 at 10:30 | vote | accept | hermi | ||
| Apr 13, 2021 at 10:30 | vote | accept | hermi | ||
| Apr 13, 2021 at 10:30 | |||||
| Apr 13, 2021 at 10:30 | history | edited | Steven | CC BY-SA 4.0 |
deleted 10 characters in body; edited tags; edited title
|
| Apr 13, 2021 at 10:25 | vote | accept | hermi | ||
| Apr 13, 2021 at 10:30 | |||||
| Apr 13, 2021 at 9:51 | answer | added | kviiri | timeline score: 2 | |
| Apr 13, 2021 at 9:51 | answer | added | Steven | timeline score: 2 | |
| Apr 13, 2021 at 9:49 | comment | added | Ariel | $w$ is a word, your language simply consists of all binary strings that can be written as some number of repetitions of the same block | |
| Apr 13, 2021 at 9:43 | history | edited | Steven | CC BY-SA 4.0 |
added 47 characters in body
|
| Apr 13, 2021 at 9:36 | review | First posts | |||
| Apr 18, 2021 at 6:01 | |||||
| Apr 13, 2021 at 9:34 | history | asked | hermi | CC BY-SA 4.0 |