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.

ES6-compliant shim for Number.isFinite.

Finite Field Library In Web Assembly

A minimal implementation of xstate fsm for UI machines

Finite state automata for Redux.

Test if a finite double-precision floating-point number is an integer.

Generics to work with tuples in TypeScript

Returns true if a number or string value is a finite number. Useful for regex matches, parsing, user input, etc.

Finite Field Library in Javascript

Finite Field Library in Javascript

Automata is a Deterministic Finite State Machine automata framework featuring: a JSON based automata definition, timed transitions, sub-states, guards, FSM registry, etc.

Topological indexing for simplicial complexes

RE2JS is the JavaScript port of RE2, a regular expression engine that provides linear time matching

Lightweight state machine library to define and manage state transition declaratively

HFSM Implementation

Test if a single-precision floating-point numeric value is finite.

A small Javascript Promise-based Finite State Machine implementation

A library for building cellular automata simulations with WebGPU: neural CA (worms), Gray-Scott reaction-diffusion, Lenia, an 18-type pokemon battle CA, life-like and elementary (Wolfram) rules — plus a small framework for writing custom rules in WGSL wit

Official API client SDK for the Automata cross-chain AI agent platform. Chat, bridge, swap, and track transactions across Base, Celo, Ethereum, and Stellar.

A greedy, streaming lexer written in vanilla Javascript