REGAL: A Library to Randomly and Exhaustively Generate Automata
From MaRDI portal
Publication:3503915
DOI10.1007/978-3-540-76336-9_28zbMath1139.68355OpenAlexW1780862850MaRDI QIDQ3503915
Cyril Nicaud, Frédérique Bassino, Julien David
Publication date: 10 June 2008
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_28
Related Items
Random Deterministic Automata, Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata, Average case analysis of Moore's state minimization algorithm, Loops and overloops for tree-walking automata, Parametric random generation of deterministic tree automata, REGAL, Random Generation of Deterministic Tree (Walking) Automata, Average complexity of Moore's and Hopcroft's algorithms
Cites Work