Libraries tagged by finite automaton

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

Go to Download

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

Go to Download

State machines for Eloquent models with Enums

Go to Download

PHP Finite-state Machine

Go to Download

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

Go to Download

Nondeterministic finite automaton

Go to Download

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

Go to Download

Finite state automata engine

Go to Download

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

Go to Download

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

Go to Download

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

Go to Download

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

Go to Download

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

Go to Download

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

Go to Download

Filter sensitive words based on determination of Finite Automata (DFA) algorithm.

Go to Download