Java implementation of a Definite & Indefinite finite automata
-
Updated
Nov 10, 2018 - Java
Java implementation of a Definite & Indefinite finite automata
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
Finds the minimum DFA (automaton) from a set of sequences in input
Deterministic finite automaton implementation that allows to create an interactively Automaton.
A library that implements formal finite state automata.
一个可爱的、(可能)高效的、支持大部分Flex语法的一个Java词法分析器
The fast scanner generator for Java™ with full Unicode support
Add a description, image, and links to the dfa-minimization topic page so that developers can more easily learn about it.
To associate your repository with the dfa-minimization topic, visit your repo's landing page and select "manage topics."