Logiciel Année : 2015

SAFA: Symbolic Algorithms for Finite Automata

Résumé

This OCaml library contains symbolic algorithms for checking language equivalence or inclusion of automata with a large alphabet, using symbolic representations (BDDs). This library can be used to obtain symbolic algorithms for Kleene algebra with tests (KAT), see library [symkat]

192 Consultations
0 Téléchargements

Partager

  • More