/intersect_union_regular_languages

Implementation 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.

Primary LanguageC++

Watchers