Tag
nondeterministic-automata
- Jun 18, 2026 Simulating an NFA Without Determinizing It: State Sets, Epsilon Closure, and Bitsets How a nondeterministic automaton runs on a single pass by carrying a set of live states, why the closure step dominates the cost, and how bitsets make it cheap. computation theory
- Jan 24, 2025 Thompson Construction: Turning a Regular Expression into an Epsilon NFA Why the construction inserts empty transitions between fragments, how each operator rewires two boundary states, and where the 2n state bound comes from. computation theory