: A Library to Randomly and Exhaustively Generate Automata
暂无分享,去创建一个
The C++ library REGAL is devoted to the random and exhaustive generation of finite deterministic automata. The random generation of automata can be used for example to test properties of automata, to experimentally study average complexities of algorithms dealing with automata or to compare different implementations of the same algorithm. The exhaustive generation allows one to check conjectures on small automata.
[1] Frédérique Bassino,et al. Enumeration and random generation of accessible automata , 2007, Theor. Comput. Sci..