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)

Library for creation and manipulation of finite automata

A greedy, streaming lexer written in vanilla Javascript

Unfancy state machine

A library to test any finite automaton with arbitrary alphabets

Tool to create and minimize DFA/NFA.

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

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

Automaton generator from regular expressions

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