DimaOanaTeodora / Minimal-DFA Public

Notifications You must be signed in to change notification settings
Fork 0
Star 3

Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states

3 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 9 Commits
Automat minimal.py		Automat minimal.py
README.md		README.md
afn.py		afn.py
in.txt		in.txt
in2.txt		in2.txt

Repository files navigation

Minimal DFA 📚

Automata theory course

Python

Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states.

About

Transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states

python automata-theory dfa-minimization

Report repository

Releases

No releases published

Packages

No packages published

Languages

Python 100.0%