A Finite Automata approach to state machines.

A Javascript class to help create powerful and robust state machines for components.

编译原理前端实现

Named function parameters for node-postgres

DFA based regex engine in typescript from scratch (not for production).

Command line interface for sinap

TypeScript port of the Java library PinIn for Chinese text match using Pinyin - 用于各类汉语拼音匹配问题的库

Profile-grouped shipping selection for Medusa v2 storefronts — one shipping method per shipping profile, so mixed carts (regulated + regular items) can actually check out

Regex utilities.

Derivatives-based regexp to DFA compiler

Regex-like pattern matching for arbitrary sequences using predicate functions

Real-time behavioral guardrails for AI agents. Detect retry storms, circular reasoning, budget overruns, and failure spirals — as they happen.

HOTKU MailHub - Professional Mass Email Verification Tool

Alternative compilation method for regular expressions

Finite State Automata

[CESM](https://github.com/IsaacAderogba/cesm) (Content Expression State Machine) is s a JavaScript toolkit for building state machines that match content expressions.

nv-array-fit ============ - nv-array-fit - similiar to regexp, but using function to define-pattern

A lean, zero dependency library to provide a useful base for your project.

Make Jison parser to semi-passive.

A portable regular-expression grammar -- a true regular language, with a Thompson-construction reference matcher -- so a pattern means the same thing in process and wherever trilean-sql can push it down to a database's own engine.