Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

---

You are here		blog.notdot.net Damn Cool Algorithms: Levenshtein Automata - Nick's Blog
|	|	deniskyashif.com Implementing a Regular Expression Engine · Denis Kyashif's Blog	2.6 parsecs away Travel
|	|	In this article we learn how to implement a simple and efficient regular expression engine following the Thompson's construction algorithm.
|	|	nitely.github.io A DFA for submatches extraction | Nitely's blog	3.3 parsecs away Travel
|	|	Finite Automata is commonly used to efficiently match a Regular Expression (RE) to a given textinput. There are RE engines for submatch extraction based on Non-deterministic Finite Automata (NFA). These algorithms usually return a single match for each submatch, instead of the history of submatches (full parse tree). An NFA can be converted to a Deterministic Finite Automata (DFA) to improve the runtime matching performance. This article describes an algorithm based on DFA that extracts full parse trees from text.
|	|	swtch.com Regular Expression Matching Can Be Simple And Fast	2.9 parsecs away Travel
|	|
|	|	initialcommit.com How to read input from console in Java	20.4 parsecs away Travel
|		This tutorial shows several ways for reading input from a console in Java.

home connect explore probe about/faq blog mcp contact updated: 2026-07-01