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
Unfancy state machine
Make any JavaScript object to be a finite state machine
Allow construction, validation, and manual step-through of a simple DFA.
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
Javascript class library that models DFA(Deterministic Finite Automaton)
Automaton generator from regular expressions
RegexSolver allows you to manipulate regular expressions as sets, enabling operations such as intersection, union, and subtraction.
Automata utility package for FSMs, PDAs, TMs in JS/TS.
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
Tool to create and minimize DFA/NFA.
This is a package for creating and using finite automita
Generates fractal time series of a specified length based on DFA algorithm within a specified range.
DFA based regex engine in typescript from scratch (not for production).
use dfa to filter sensitive words