A Python library for simulating and visualizing finite automata
KTU 7th Semester Compiler Design lab programs along with algorithms
An ecosystem of packages to work with automaton and parsers (dfa/nfa/e-nfa/regex/cfg/pda)
eNFA - NFA, DFA - DFA minimization, CNF and CKY
Converts a given epsilon-NFA to NFA to DFA
北京邮电大学《形式语言与自动机》实验一：NFA到DFA的转化
A utility tool used for validating regular expressions corresponding to a provided word
Concepts of DFA, NFA , epsilon-NFA and others concepts of Finite Automata
Introduction to automata theory, languages and computation
DFA, NFA and epsilon-NFA simulator in pure Python. Loads an automaton from a plain-text definition file and decides string membership, with a verbose trace of nondeterministic forks.
Automata implementations
Epsilon-NFA to NFA to DFA to Minimal DFA Conversion tool. C# (.NET Framework).
Regex to ε-NFA visualizer using Thompson Construction Algorithm.
fsmconv is a command-line tool for converting FSA from one to another representation.
Desktop app for converting NFA (Non Deterministic Finite Automata) to DFA (Deterministic Finite Automata)
To associate your repository with the epsilon-nfa topic, visit your repo's landing page and select "manage topics."