Explore >> Select a destination
|
You are here 
|
www.jeremykun.com | ||
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
harrisongoldste.in
|
|
| | | | | ||
| | | | |
emanueleviola.wordpress.com
|
|
| | | | | This is a book about computational complexity theory. However, it is perhaps sui generis for various reasons: 1. The presentation is also geared towards an algorithmic audience. Our default model is the RAM (Chapter 1), the standard model for algorithmic research. This is in contrast with other texts which focus on tape machines. I reduce... | |
| | | | |
leafo.net
|
|
| | | What is a PEG What is LPeg Installing LPeg Some simple grammars String equality Combining patterns Parsing numbers A calculator expression parser Closing What is a PEG A PEG, or Parsing Expression Grammar, is a way of describing a language (or patter... | ||
