SAFA: Symbolic Algorithms for Finite Automata
Damien Pous · HAL (Le Centre pour la Communication Scientifique Directe) · 2015
This OCaml library contains symbolic algorithms for checking languageequivalence or inclusion of automata with a large alphabet, usingsymbolic representations (BDDs).This library can be used to obtain symbolic algorithms for Kleenealgebra with tests (KAT), see library [symkat]