Arithemtic over finite polynomial rings
field element module for usage in EC
A collection of extendable finite automata with immutable state and transition data.
Deterministic Algebraic Deterministic Dynamics (ADD) parameter sweeps for AET, TCP, RLT, and IWLT
Procedural macro for generating finite automaton
Finite difference PDE solvers in Rust — heat equation, wave equation, Poisson, advection-diffusion with boundary conditions
This crate provides Discrete Interval Tree Data-Structures, which are based off BTreeMap.
Finit is a library for defining sets of data, and then performing set operations on them. It is designed to be used for permission systems, but can be used for any kind of data that can be represented as a set.
GPU acceleration for mathematical computations
Pure-Rust numerical algorithms library — high performance with SIMD support while also supporting no-std for embedded and WASM targets.
Guarantee deterministic limits on execution time and space resources made available to the WebAssembly programs in a runtime-agnostic way.
2d constrained Delaunay triangulation
Simple finite state machines with integrated Celluloid timeout support.
There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general. But if all you want is a finite state machine, look no further: this has less than 50 lines of code and provides everything a finite state machine must have, and nothing more.
Fast implementation of finite and complement sets in Ruby
A minimal finite state machine with a straightforward syntax. You can quickly model states, add callbacks and use object-oriented techniques to integrate with ORMs.
Finite state machine implementation that keeps logic separate from model classes and supports sub-states.
A C/C++ code generator that creates code for a finite state machine given a description in graphviz language.
There are many finite state machine implementations for Ruby, and they all provide a nice DSL for declaring events, exceptions, callbacks, and all kinds of niceties in general. But if all you want is a finite state machine, look no further: this is only 22 lines of code and provides everything a finite state machine must have, and nothing more.
A barebone implementation of the finite state machine keeping simplicity in mind.
MicroFSM implements a minimal/simple Finite-State Machine (FSM). Transitions are triggered by events. An action for a transition can be added as a callback.
A library for describing and visualizing finite automata
Finite Field implementation in Ruby.
Use plain text to define finite machines.