Detrended Fluctuation Analysis (DFA) for JavaScript — measure fractal scaling, Hurst exponent, long-range correlations, 1/f noise, and HRV variability in time series data. Computes alpha, alpha1, alpha2, SDNN, RMSSD, and PNN50.
A library for finite automata and regular expressions in the context of JS RegExp
A state machine compiler
Salute Design System / React UI kit for SDDS DFA web applications
Regular Expressions parser in JavaScript
Report pull request impacts on performance metrics
RE2JS is the JavaScript port of RE2, a regular expression engine that provides linear time matching
Common Heart rate variability (HRV) analysis metrics
Generates fractal time series of a specified length based on DFA algorithm within a specified range.
Tool to create and minimize DFA/NFA.
Deterministic finite automata compiler
Integrates performance impact to your pull requests on GitHub
Sdds-themes package
Creates a Deterministic Finite Automata (DFA) from regular expressions
Multi-agent repository documentation skill package with a CLI adapter for install, init, refresh, and doctor workflows.
CLI for regexp-tree package
A lightweight data preprocessing library for cleaning datasets—handles missing values, duplicates, and feature correlations with ease.
A library convert regular expression to finite state matchine
a DFA algorithm achived by NodeJS
UUIDS generator for databases.
A small library to get an insight and test any Deterministic finite automaton(DFA) with binary alphabets
A Javascript library for creating and working regular expressions. It offers API to transform regexes all the way into deterministic finite automata (DFA) and back. Is not supposed to be used to match strings, but rather to display how regexes work.
Build, visualize, and interact with different kinds of automata (DFA, NFA, PDA).