Dfa Packages

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

Detect a sequence of keys being pressed.

Regular Expression Lexer, Parser, and Minimizer

Creates a Deterministic Finite Automata (DFA) from regular expressions

covnert NFA to DFA (json,file)

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

Library for creation and manipulation of finite automata

Javascript class library that models DFA(Deterministic Finite Automaton)

Nondeterministic Finite Automata

A greedy, streaming lexer written in vanilla Javascript

deterministic finite automaton code bricks for JavaScript

Finate State Automata JS Solutions

Unfancy state machine

Make any JavaScript object to be a finite state machine

Javascript class library that models DFA(Deterministic Finite Automaton)

Create and run Finite Deterministic Machines (DFAs)

This is a package for creating and using finite automita

use dfa to filter sensitive words

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

deterministic finite automaton code bricks for JavaScript