grachale / intersect_union_regular_languages Goto Github PK
View Code? Open in Web Editor NEWImplementation of an algorithm that enables finding the minimal deterministic finite automaton that accepts the intersection or union of languages defined by a pair of finite automata.