Timeline for Proof that the $\omega$-language consisting of all words containing every finite word as a factor is not rational/regular
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 20, 2013 at 21:59 | comment | added | The User | Every non-empty ω-regular language contains an ultimately periodic word. | |
| Oct 20, 2013 at 20:32 | vote | accept | StefanH | ||
| Oct 20, 2013 at 20:24 | answer | added | Joel David Hamkins | timeline score: 3 | |
| Oct 20, 2013 at 19:59 | history | asked | StefanH | CC BY-SA 3.0 |