Timeline for Why are non-deterministic Buchi automata factorially succinct when compared to deterministic Rabin Automata?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 4 at 20:40 | answer | added | Bader Abu Radi | timeline score: 2 | |
| Apr 26, 2018 at 14:35 | comment | added | Raphael | What have you tried? Where did you get stuck? We do not want to just hand you the solution; we want you to gain understanding. However, as it is we do not know what your underlying problem is, so we can not begin to help. See here for tips on asking questions about exercise problems. If you are uncertain how to improve your question, why not ask around in Computer Science Chat? | |
| Apr 26, 2018 at 14:34 | history | edited | Raphael |
edited tags
|
|
| Apr 26, 2018 at 14:11 | history | edited | Agnishom Chattopadhyay | CC BY-SA 3.0 |
added 18 characters in body; edited title
|
| Apr 26, 2018 at 10:32 | answer | added | DCTLib | timeline score: 5 | |
| Apr 26, 2018 at 5:08 | answer | added | Qaphqa | timeline score: -2 | |
| Apr 26, 2018 at 1:49 | history | asked | Agnishom Chattopadhyay | CC BY-SA 3.0 |