NFA Packages

A library for finite automata and regular expressions in the context of JS RegExp

Takes a context-free grammar and converts it into a decision-making graph. Can produce interactive Guides which generate valid sentences from the grammar.

Regular Expression Lexer, Parser, and Minimizer

covnert NFA to DFA (json,file)

A greedy, streaming lexer written in vanilla Javascript

Library for creation and manipulation of finite automata

Unfancy state machine

Automaton generator from regular expressions

Automata utility package for FSMs, PDAs, TMs in JS/TS.

DFA based regex engine in typescript from scratch (not for production).

RegexSolver allows you to manipulate regular expressions as sets, enabling operations such as intersection, union, and subtraction.

Tool to create and minimize DFA/NFA.

A library to test any finite automaton with arbitrary alphabets