Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
-
Updated
Mar 15, 2018 - C++
Fast and effective automaton software that can simulate acceptance tests in a state machine style also providing support for validation, minimization and complement generation.
Principles of Compiler Design Programs
This is the "one": Linuxy infrastructureish mostly C++ code.
a c++ program that takes a dfa as input and output its minimum equivalence states partitions and corresponding minimum state transition table.
Java compiler of 2 phases: Lexical analyzer generator and Parser generator.
A program that takes a dfa as input and output its minimum equivalence states partitions.
Implementation of a dictionary based on minimal deterministic finite-state automata
Aim is to convert a given DFA to its minimized state
DFA Minimization
This is a theory of computation course topics simulator
Automata implementations
MIPT "Formal languages and translations" course
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."