Timeline for An NFA with no equivalent DFA with fewer than $2^n$ states: Example and Proof
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2016 at 15:12 | history | tweeted | twitter.com/StackCompSci/status/713745522155249664 | ||
| Mar 23, 2016 at 22:39 | comment | added | D.W.♦ | What specifically are you confused about? What's the first part that you find confusing? When you mention "this line", which line are you referring to? We prefer you ask a question about a specific aspect of the writing, not just ask "can you explain the whole thing to me?" -- if you didn't understand the explanation in the book, I worry we could write up another long explanation and you might just say "sorry, I didn't understand that either". The more you give us to work with, the more likely we can give you useful answers. | |
| Mar 23, 2016 at 20:13 | answer | added | Rick Decker | timeline score: 5 | |
| Mar 23, 2016 at 19:02 | answer | added | Yuval Filmus | timeline score: 5 | |
| Mar 23, 2016 at 18:50 | history | asked | nerdier.js | CC BY-SA 3.0 |