Search results
41 packages found
Derivatives-based regexp to DFA compiler
A simple implementation of a dynamic finite state machine represinting an instance of a DFA (deterministic finite automata)
Creates a Deterministic Finite Automata (DFA) from regular expressions
This is a package for creating and using finite automita
Automata is a Deterministic Finite State Machine automata framework featuring: a JSON based automata definition, timed transitions, sub-states, guards, FSM registry, etc.
A lexical analysis / regular expression engine written in TypeScript
abuse word filter and replace algorithm using trie and DFA
TypeScript library implementing the finite-state machine
A string parser using dfa state machine
basic data flow analyses framework based on esprima
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
use dfa to filter sensitive words
LR Parser (my way)
Library for creation and manipulation of finite automata
Allow construction, validation, and manual step-through of a simple DFA.
A small library to get an insight and test any Deterministic finite automaton(DFA) with binary alphabets
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
Regular Expression Lexer, Parser, and Minimizer