Thompson's construction
en.wikipedia.org · 1,769 words · saved by 2 readers
Couldn't find lead section for Thompson's_construction
Thompson's construction - Wikipedia Jump to content From Wikipedia, the free encyclopedia Algorithm to transform a regular expression into a finite automaton In computer science , Thompson's construction algorithm , also called the McNaughton–Yamada–Thompson algorithm , [ 1 ] is a method of transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). [ 2 ] This NFA can be used to match strings against the regular expression. This algorithm is credited to Ken Thompson . Regular expressions and nondeterministic finite automata are two representati
saved by
related reading
- GitHub - kyx0r/pikevm: Russ Cox/Rob Pike pikevm regex implementationgithub.com
- Chomsky hierarchy - Wikipediaen.wikipedia.org
- Implementing Regular Expressionsswtch.com
- web.stanford.edu/class/cs143/lectures/lecture04.pdfweb.stanford.edu
- Thompson_1984_ReflectionsonTrustingTrust.pdfcs.cmu.edu
- Context-free grammar - Wikipediaen.wikipedia.org
- Nondeterministic Turing machine - Wikipediaen.wikipedia.org
- Index 1,600,000,000 Keys with Automata and Rust - Andrew Gallant's Blogburntsushi.net
- Regular expression - Wikipediaen.wikipedia.org
- Mediumanshuphukan031.medium.com
- Competitive Programmer's Handbookcses.fi
- Yudhister Kumaryudhister.me