print · source · login   

Random DFAs

Tag: random

Description

We have included two sets of randomly generated DFAs in our repository:

  • $3\,600$ DFAs with $1\,000$ states each over the alphabet $\Sigma = \{ 0, 1, \ldots, 19\}$
  • $3\,600$ DFAs with $2\,000$ states each over the alphabet $\Sigma = \{ 0, 1, \ldots, 9\}$

The number of states and the number of elements in the input/output alphabets of these automata were chosen to be challenging, though still manageable for state-of-the-art learning and testing algorithms. All DFAs were generated using libalf's off-the-shelf implementation of Champarnaud and ParanthoŽn's method.