JSPM

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

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

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

A greedy, streaming lexer written in vanilla Javascript

Automaton generator from regular expressions

Allow construction, validation, and manual step-through of a simple DFA.

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

Detect a sequence of keys being pressed.

Finate State Automata JS Solutions

Tool to create and minimize DFA/NFA.

Unfancy state machine

Javascript class library that models DFA(Deterministic Finite Automaton)

DFA-based workflow MCP server for guiding LLM task completion

use dfa to filter sensitive words

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

This is a package for creating and using finite automita

Make any JavaScript object to be a finite state machine

Nondeterministic Finite Automata

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

A library to test any finite automaton with arbitrary alphabets

Derivatives-based regexp to DFA compiler

Creates a Deterministic Finite Automata (DFA) from regular expressions

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

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

A string parser using dfa state machine

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

Library for creation and manipulation of finite automata

Regular Expression Lexer, Parser, and Minimizer

Create and run Finite Deterministic Machines (DFAs)

TypeScript library implementing the finite-state machine

Javascript class library that models DFA(Deterministic Finite Automaton)