No description provided.
Finit state machine writen in typescript
Finit state machine library
this is init finit
A simple finite state machine library
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Anthony Nelzin-Santos Les nouveautés de macOS Sierra is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Susanna Carr Chantage et séduction is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Chloé Aeberhardt Les Espionnes racontent is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ P-J Hérault Le Bricolo is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Moka Derrière la porte is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Collectif Recettes inratables sans four is available now
Ｄｏｗｎｌｏａｄ ｅｂｏｏｋ ｐｄｆ ｍｏｂｉ ｅｐｕｂ Aude Vidal-Lessard Les griffes is available now
Copyable mixin adds copyability and clonability to your class. The module uses defined relation to deduce how to copy / clone the instance.
State machine
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.
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.
Arithemtic over finite polynomial rings
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.
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.
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
Finite Field implementation in Ruby.
A library for describing and visualizing finite automata
A finite state machine for the Ruby programming language. Dependency free, highly declarative and with a minimal API.
This library provides several ways of describing a finite Markov Decision Process (MDP) model (see FiniteMDP::Model) and some reasonably efficient implementations of policy iteration and value iteration to solve it (see FiniteMDP::Solver).
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.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.
No description provided.