Timeline for Myhill-Nerode and closure properties
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2017 at 16:13 | comment | added | StefanH | Surely you can easily translate between Nerode classes and minimal automata, but anyway I added a proof which uses the classes, and to my knowledge could not be transferred to any automaton construction that easily, as it works with the classes as sets, which is somehow neglected if we use an automaton and construct for example a product automaton to derive closure properties. Hence I would regard it as a "truly" Nerode classes only argument. | |
| Dec 16, 2012 at 21:15 | comment | added | Hendrik Jan | Well, I was not asking for original research, thanks. I was hoping that someone knew whether the knowledge of $\sim_K$ being finite index would predict $\sim_{\phi(K)}$ being finite index, where $\phi$ is a language operation. I tried for $\phi$=prefix, but I cannot see how concatenation is handled in an elegant way. Yes, I can construct a decent DFA for it. | |
| Dec 16, 2012 at 20:08 | history | answered | Yuval Filmus | CC BY-SA 3.0 |