JSPM

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

Creates a Deterministic Finite Automata (DFA) from regular expressions

Nondeterministic Finite Automata

A simple implementation of a dynamic finite state machine represinting an instance of a DFA (deterministic finite automata)

Derivatives-based regexp to DFA compiler

Create and run Finite Deterministic Machines (DFAs)

A string parser using dfa state machine

javascript flow engine to be run on Node to support web and native mobile applications

Regular Expression Lexer, Parser, and Minimizer

TypeScript library implementing the finite-state machine

Javascript class library that models DFA(Deterministic Finite Automaton)