👮‍♂️The sensitive word tool for java.(敏感词/违禁词/违法词/脏词。基于 DFA 算法实现的高性能 java 敏感词过滤工具框架。请勿发布涉及政治、广告、营销、翻墙、违反国家法律法规等内容。高性能敏感词检测过滤组件，附带繁体简体互换，支持全角半角互换，汉字转拼音，模糊搜索等功能。)

🔐Sensitive log tool for java, based on java annotation. (基于注解的 java 日志脱敏工具框架，更加优雅的日志打印。支持自定义哈希、支持基于 log4j2 插件的统一脱敏、支持 logback 插件统一脱敏)

The fast scanner generator for Java™ with full Unicode support

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

The high performance pinyin tool for java.(java 高性能中文转拼音工具。支持同音字。)

📄Sensitive word filtering items provide TTMP, DFA, DAT, hash bucket, and Tire algorithm support filtering. Supports text highlighting, filtering, verdicts, and alternative interface support.敏感词过滤项目，提供TTMP、DFA、DAT、hash bucket、Tire算法支持过滤。可以支持文本的高亮、过滤、判词、替换的接口支持。

The jieba-analysis tool for java.（基于结巴分词词库实现的更加灵活优雅易用，高性能的 java 分词实现。支持词性标注。）

dregex is a Java library that implements a regular expression engine using deterministic finite automata (DFA). It supports some Perl-style features and yet retains linear matching time, and also offers set operations.

1. Use Thompson algorithm to convert the regular expression to NFA 2. Use the subset construct to convert NFA to DFA 3. Minimize DFA to MFA 4. Use MFA to match strings

converting regex (regular expression) to DFA directly by creating syntax tree in java

敏感词过滤 DFA算法

use asm to parse classNode then get method invoke relations.解析获得方法调用链路

Regular Expressions and Lexing with DFAs

A JavaFX-based tool for visualizing and minimizing DFAs (Deterministic Finite Automata), allowing users to easily create, edit, and optimize state machines.

Regex libraries benchmark

Processing Formal Languages and Automata Package

Java program to Minimize deterministic finite automata, Convert NFA to DFA and graphically represent the results.

A little toolbox that provides detector and converter for DFA machines

A compiler written in Java. Written for Algol. Generates MIPS assembly code as final output.

The aim of this project is to design and implement a library allowing to generate and represent finite state machine also know as finite automaton. The library will also implement algorithms to perform operations that are specific to finite state automaton : Determination, Minimization, Complementary, Elimination of ***ε*** transitions, etc