GitHub / grachale / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/grachale%2Fintersect_union_regular_languages
PURL: pkg:github/grachale/intersect_union_regular_languages
Stars: 1
Forks: 0
Open issues: 0
License: None
Language: C++
Size: 9.77 KB
Dependencies parsed at: Pending
Created at: almost 2 years ago
Updated at: about 1 year ago
Pushed at: almost 2 years ago
Last synced at: 28 days ago
Topics: automata-theory, cpp, regular-languages, theoretical-computer-science