Libraries tagged by dfa

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

Go to Download

This is a DFA algorithm based on PHP

Go to Download

sensitive-dfa

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

PHP-dfa敏感词过滤

Go to Download

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

Go to Download

copy from FireLustre/php-dfa-sensitive,To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download

Find keywords by using DFA.

Go to Download

copy from FireLustre/php-dfa-sensitive,To achieve the filtering of sensitive words, based on the determination of finite automata (DFA) algorithm.

Go to Download

this is a test

Go to Download

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

Go to Download

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

Go to Download

PHP基于确定有穷自动机算法（DFA）的敏感词过滤器

Go to Download

sensitive words

Go to Download