/explore
|
You are here 
|
swtch.com | ||
| | | | |
pbrisbin.com
|
|
| | | | | While reading Understanding Computation again last night, I was going back through the chapter where Tom Stuart describes deterministic and non-deterministic finite automata. These simple state machines seem like little more than a teaching tool, but he eventually uses them as the implementation for a regular expression matcher. I thought seeing this concrete use for such an abstract idea was interesting and wanted to re-enforce the ideas by implementing such a system myself - with Haskell, of course. | |
| | | | |
www.dalkescientific.com
|
|
| | | | | ||
| | | | |
rcoh.me
|
|
| | | | | Russell Cohen's Blog and Website | |
| | | | |
tonsky.me
|
|
| | | Modern extension to classic 2003 article by Joel Spolsky | ||
