Timeline for answer to How to show R*S(U+TR*S)* is equivalent to (R+SU*T)*SU*? by Emil Jeřábek
Current License: CC BY-SA 4.0
Post Revisions
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 3 hours ago | comment | added | Emil Jeřábek | Yes, so it’s the same. | |
| 5 hours ago | comment | added | Plague | This is the method I am referring as $R^{(k)}_{ij}$ method. | |
| yesterday | history | edited | Emil Jeřábek | CC BY-SA 4.0 |
added 400 characters in body
|
| yesterday | comment | added | Emil Jeřábek | I am not using in any way that the automaton is deterministic or minimal. Just that it is already given and quite simple. | |
| yesterday | comment | added | Pseudonym♦ | Specifically, there is a unique minimal DFA for any regular language. And if it's this small, showing that the are the same is not difficult. | |
| yesterday | history | answered | Emil Jeřábek | CC BY-SA 4.0 |