DFA Packages

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.

A string parser using dfa state machine

TypeScript library implementing the finite-state machine

A lexical analyzer based on DFA that is built using JS and supports multi-language extensions

Tool to create and minimize DFA/NFA.

A small library to get an insight and test any Deterministic finite automaton(DFA) with binary alphabets

Derivatives-based regexp to DFA compiler

A library to test any finite automaton with arbitrary alphabets

Generates fractal time series of a specified length based on DFA algorithm within a specified range.