An asynchronous sensitive word converter/validator based on DFA.
A simple implementation of a dynamic finite state machine represinting an instance of a DFA (deterministic finite automata)
abuse word filter and replace algorithm using trie and DFA
Unfancy state machine
Detect a sequence of keys being pressed.
Streaming+Async lexer and parser
covnert NFA to DFA (json,file)
A lexical analysis / regular expression engine written in TypeScript
Finate State Automata JS Solutions
A library for finite automata and regular expressions in the context of JS RegExp
Automata is a Deterministic Finite State Machine automata framework featuring: a JSON based automata definition, timed transitions, sub-states, guards, FSM registry, etc.
Derivatives-based regexp to DFA compiler
Regular Expression && FSM
LR Parser (my way)
Allow construction, validation, and manual step-through of a simple DFA.