Libraries tagged by finite automaton

lustre/php-dfa-sensitive

773 Favers
160992 Downloads

To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download


rolfvreijdenberger/izzum-statemachine

73 Favers
26350 Downloads

A superior statemachine library php >= 5.3. Integrates with your domain models perfectly.

Go to Download


kendall-hopkins/formal-theory

34 Favers
9625 Downloads

FormalTheory is a library that allows for manipulation and conversion of NFAs, DFAs and Regular Expressions.

Go to Download


norotaro/enumata

4 Favers
4010 Downloads

State machines for Eloquent models with Enums

Go to Download


zinovyev/php-fsm

11 Favers
7663 Downloads

PHP Finite-state Machine

Go to Download


chatflowphp/automata

0 Favers
48 Downloads

Framework-agnostic state machine runtime for persistent step-by-step flows in PHP: chat dialogs, wizards, workflows.

Go to Download


carlosv2/fa

0 Favers
6 Downloads

Nondeterministic finite automaton

Go to Download


tonix-tuft/status-quo

0 Favers
79 Downloads

A simple generic library to implement FSMs (Finite-State Machines) and the State Design Pattern in PHP.

Go to Download


markusbiggus/stateengine

0 Favers
0 Downloads

Finite state automata engine

Go to Download


witrin/formal-theory

1 Favers
18626 Downloads

FormalTheory is a library that allows for manipulation and conversion of NFAs, DFAs and Regular Expressions.

Go to Download


c01l/formal-theory

0 Favers
218 Downloads

FormalTheory is a library that allows for manipulation and conversion of NFAs, DFAs and Regular Expressions.

Go to Download


zz98500/php-dfa-sensitive

0 Favers
69 Downloads

To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download


wuxiumu/sensitive-word-filtering

1 Favers
14 Downloads

To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download


ufucms/php-dfa-sensitive

0 Favers
23 Downloads

To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download


mucts/dfa

0 Favers
9 Downloads

Deterministic Finite Automaton,即确定有穷自动机。其特征为:有一个有限状态集合和一些从一个状态通向另一个状态的边,每条边上标记有一个符号,其中一个状态是初态,某些状态是终态。但不同于不确定的有限自动机,DFA中不会有从同一状态出发的两条边标志有相同的符号。

Go to Download


Next >>