A library for finite automata and regular expressions in the context of JS RegExp
-
Updated
Oct 22, 2023 - TypeScript
A library for finite automata and regular expressions in the context of JS RegExp
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
An asynchronous sensitive word converter/validator based on DFA.
Derivatives-based regexp to DFA compiler
NFA and DFA simulator by Booker Martin
A javascript finite state machine library written in typescript heavily inspired by jakesgordon/javascript-state-machine
Fast JavaScript/TypeScript LR(1) parser generator
React rewrite of my third-year project from university, an educational tool for finite automata. Currently in development.
Automaton execution and manipulation tool for Deno
Add a description, image, and links to the dfa topic page so that developers can more easily learn about it.
To associate your repository with the dfa topic, visit your repo's landing page and select "manage topics."