Minimal DFA 📚

Automata theory course

Python

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

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