Skip to content

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

Notifications You must be signed in to change notification settings

DimaOanaTeodora/Minimal-DFA

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 

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

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages