REGAL: a library to randomly and exhaustively generate automata
Résumé
This paper presents a library devoted to the random and exhaustive generation of finite deterministic automata. This package provides a toolkit to experimentally study properties of automata, average complexities of algorithms dealing with automata or to compare different implementations of the same algorithm.
Origine | Fichiers produits par l'(les) auteur(s) |
---|