A non-backtracking NFA/DFA-based Perl-compatible regex engine matching on large data streams
An open source implementation of the Small Cell Forum's Network Functional API (nFAPI)
a visual NFA to DFA converter
Exercise 1 - Conversion of Non-Deterministic Finite Automaton (NFA) To Deterministic Finite Automaton (DFA)
A website that simulates various finite state machines: DFA, NFA, PDA.
NFA generator, simulator
An interactive c++ program to construct NFA, DFA, and minimized DFA from a given regular expression.
nFaaS -> NiFi Flow as a Service
Conversions covered: regex to NFA, NFA to DFA, DFA to regex. Minimizing DFA.
NFA to DFA Conversion Implementation in C++.
A Web Application to convert NFA to DFA.
Simple Java implementation for PDA, DFA and NFA.
Academic Python Library to manage DFA, NFA and AFW automata.
Automata (DFA/NFA/PDA/TM) diagrams made easy with LaTeX and Metapost
DFA and NFA finite state automata in Lisp, CSV format file reader
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
Regular Expression (Regex), Nondeterministic finite automaton (NFA) and Deterministic finite automaton (DFA) implement in PHP.
正则转NFA再转DFA的可视化分析工具
使用汤普森法进行正规式转NFA
A Python program to convert a Non-deterministic Finite Automaton (NFA) to a Deterministic Finite Automaton (DFA).
A python program to build nfa, dfa and minimised DFA from given regular expression. Uses Tkinter for GUI and GraphViz for graphs.