Timeline for Is the class of star-free languages just the complement to counter languages within the regular language class?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 6, 2023 at 23:35 | vote | accept | Crea Teeth | ||
| Nov 6, 2023 at 22:46 | history | edited | Crea Teeth | CC BY-SA 4.0 |
added 72 characters in body
|
| Nov 6, 2023 at 22:34 | history | edited | Crea Teeth | CC BY-SA 4.0 |
added 312 characters in body
|
| Nov 6, 2023 at 22:31 | answer | added | Hendrik Jan | timeline score: 2 | |
| Nov 6, 2023 at 22:23 | comment | added | Crea Teeth | This is kind of part of my question. I don't understand what counter languages precisely are and how they can be regular. I'll edit my question to diffuse things a bit. | |
| Nov 6, 2023 at 4:22 | comment | added | D.W.♦ | I am having difficulty understanding what your question is. I encourage you to refer to en.wikipedia.org/wiki/Aperiodic_finite_state_automaton, then edit your question to state clearly what your question is. I think you might find it a helpful exercise to link to or state what formal definition you are using for counter-free. | |
| Nov 5, 2023 at 23:10 | history | asked | Crea Teeth | CC BY-SA 4.0 |