Timeline for Regular languages closed under quotients with arbitrary languages
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4, 2016 at 16:11 | answer | added | J.-E. Pin | timeline score: 4 | |
| Dec 6, 2015 at 23:02 | history | edited | Raphael |
edited tags
|
|
| Dec 6, 2015 at 22:37 | comment | added | Yuval Filmus | No, there is no requirement of computability here. | |
| Dec 6, 2015 at 22:20 | comment | added | michbad | It's the question of constructing such sets of states from which we reach a final state by some/all strings of B. Would we need to prove they are decidable? | |
| Dec 6, 2015 at 22:18 | comment | added | Yuval Filmus | What do you think? Have you tried proving or disproving it? | |
| Dec 6, 2015 at 22:05 | history | asked | michbad | CC BY-SA 3.0 |