Search results
30 packages found
Sort by: Default
- Default
- Most downloaded this week
- Most downloaded this month
- Most dependents
- Recently published
A library for finite automata and regular expressions in the context of JS RegExp
Finate State Automata JS Solutions
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
Automata utility package for FSMs, PDAs, TMs in JS/TS.
Unfancy state machine
Tool to create and minimize DFA/NFA.
Detect a sequence of keys being pressed.
A library to test any finite automaton with arbitrary alphabets
- dfa
- nfa
- nfa-to-dfa-conversion
- finite-automata
- automaton-testing
- epsilon-nfa
- epsilon-nfa-to-nfa
- regex
- automaton
A simple implementation of a dynamic finite state machine represinting an instance of a DFA (deterministic finite automata)
Javascript class library that models DFA(Deterministic Finite Automaton)
Make any JavaScript object to be a finite state machine
RegexSolver allows you to manipulate regular expressions as sets, enabling operations such as intersection, union, and subtraction.
DFA based regex engine in typescript from scratch (not for production).
Create and run Finite Deterministic Machines (DFAs)
- dfa
- deterministic
- finite
- automata
- automaton
- deterministic finite automata
- deterministic finite automaton
- graph
- monad
- state machine
Nondeterministic Finite Automata
use dfa to filter sensitive words
Javascript class library that models DFA(Deterministic Finite Automaton)
javascript flow engine to be run on Node to support web and native mobile applications