Meme
I've done this one before but that was a couple of years ago now and in a different place. Though still surrounded by work books, sorry.
via kensson
1. Grab the nearest book.
2. Open the book to page 56.
3. Find the fifth sentence.
4. Post the text of the next seven sentences in your journal along with these instructions.
5. Don't dig for your favorite book, the cool book, or the intellectual one: pick the CLOSEST.
6. Take it if you want it.
"Then we modify the transition function of M to place additional fingers on all states that can be reached by going along ε arrows after every step. Replacing δ(r, a) by E(δ(r,a)) achieves this effect. Thus
δ'(R,a) = {qϵQ|qϵE(δ(r,a)) for some rϵR}.
Additionally we need to modify the start state of M to move the fingers initially to all possible states that can be reached from the start state of N along the ε arrows. Changing q0' to be E({q0}) achieves this effect. We have now completed the construction of the DFA M that simulates the NFA N.
The Construction of M obviously works correctly."
Obviously!? From "Introduction to the Theory of Computing" by Michael Sipser, one of my Uni text books. In case anyone is taking that as a sign of how smart I am, or how hard my job is, I don't understand a bloody word of it and don't remember it ever coming up (would I recognise it if it did? Probably not) in my 4 year career.
via kensson
1. Grab the nearest book.
2. Open the book to page 56.
3. Find the fifth sentence.
4. Post the text of the next seven sentences in your journal along with these instructions.
5. Don't dig for your favorite book, the cool book, or the intellectual one: pick the CLOSEST.
6. Take it if you want it.
"Then we modify the transition function of M to place additional fingers on all states that can be reached by going along ε arrows after every step. Replacing δ(r, a) by E(δ(r,a)) achieves this effect. Thus
δ'(R,a) = {qϵQ|qϵE(δ(r,a)) for some rϵR}.
Additionally we need to modify the start state of M to move the fingers initially to all possible states that can be reached from the start state of N along the ε arrows. Changing q0' to be E({q0}) achieves this effect. We have now completed the construction of the DFA M that simulates the NFA N.
The Construction of M obviously works correctly."
Obviously!? From "Introduction to the Theory of Computing" by Michael Sipser, one of my Uni text books. In case anyone is taking that as a sign of how smart I am, or how hard my job is, I don't understand a bloody word of it and don't remember it ever coming up (would I recognise it if it did? Probably not) in my 4 year career.