A library for finite automata and regular expressions in the context of JS RegExp
A lean, zero dependency library to provide a useful base for your project.
Build, visualize, and interact with different kinds of automata (DFA, NFA, PDA).
TypeScript implementation of some network flow algorithms.
Takes a context-free grammar and converts it into a decision-making graph. Can produce interactive Guides which generate valid sentences from the grammar.