REGAL: a library to randomly and exhaustively generate automata

Authors:
Frédérique Bassino;Julien David;Cyril Nicaud
Affiliations:
Institut Gaspard Monge, UMR, CNRS, Université de Marne-la-Vallée, Marne-la-Vallée Cedex 2, France;Institut Gaspard Monge, UMR, CNRS, Université de Marne-la-Vallée, Marne-la-Vallée Cedex 2, France;Institut Gaspard Monge, UMR, CNRS, Université de Marne-la-Vallée, Marne-la-Vallée Cedex 2, France
Venue:
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Year:
2007

Citing 1
Cited 5

Enumeration and random generation of accessible automata

Theoretical Computer Science

Random Generation of Deterministic Tree (Walking) Automata

CIAA '09 Proceedings of the 14th International Conference on Implementation and Application of Automata
On the Use of Uniform Random Generation of Automata for Testing

Electronic Notes in Theoretical Computer Science (ENTCS)
Parametric random generation of deterministic tree automata

Theoretical Computer Science
Average complexity of Moore's and Hopcroft's algorithms

Theoretical Computer Science
Loops and overloops for Tree-Walking Automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract