safaversion

Symbolic Algorithms for Finite Automata

This OCaml library contains symbolic algorithms for checking language equivalence or inclusion of automata with a large alphabet, using symbolic representations (BDDs).

It is described in the following paper, in Proc. POPL'15 http://doi.acm.org/10.1145/2676726.2677007 https://hal.archives-ouvertes.fr/hal-01021497v2/document

This library can be used to obtain symbolic algorithms for Kleene algebra with tests (KAT), see library [symkat]

AuthorDamien Pous <Damien.Pous@ens-lyon.fr>
LicenseLGPL-3.0-only
Published
Homepagehttp://perso.ens-lyon.fr/damien.pous/safa/
MaintainerDamien Pous <Damien.Pous@ens-lyon.fr>
Dependencies
Source [http] http://perso.ens-lyon.fr/damien.pous/safa/safa-1.3.tgz
sha256=573c28fa06e3f36aeac74342cd2419eccfbcf38696c820db6cc8665b1e301d8d
md5=95a3998f980822be429c56f49fd3fad6
Edithttps://github.com/ocaml/opam-repository/tree/master/packages/safa/safa.1.3/opam
Required by