Try Notedeck free · More Computer Science demos
← Notedeck 计算机 · 正则表达式 → NFA(汤普森构造) Try in Notedeck

Regex → NFA (Thompson construction) — interactive Computer Science demo

Compile a regex to an NFA with ε-transitions, then match a string by ε-closure

Run this interactive Computer Science demo live below, or download it as a single self-contained HTML file that works offline in any browser or LMS — one of 1,900+ free interactive teaching demos on Notedeck. With Notedeck you upload your own materials and turn them into interactive courseware, question papers with answer keys, and AI-taught lessons.