REGAL: A Library to Randomly and Exhaustively Generate Automata

DOI10.1007/978-3-540-76336-9_28MaRDI QIDQ3503915zbMATH OpenOpenAlexFDO

Authors Frédérique Bassino, Julien David, Cyril Nicaud

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

zbMATH Keywords

C++ libraryfinite automatarandom generation

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Enumeration and random generation of possibly incomplete deterministic automata
• Random generation of deterministic acyclic automata using the recursive method
• Random generation of deterministic acyclic automata using Markov chains
• A new dichotomic algorithm for the uniform random generation of words in regular languages
• Enumeration and random generation of accessible automata

Cites work

• Enumeration and random generation of accessible automata

Cited in

(8)

• REGAL
• Parametric random generation of deterministic tree automata
• Average case analysis of Moore's state minimization algorithm
• Random deterministic automata
• Random generation and enumeration of accessible deterministic real-time pushdown automata
• Random Generation of Deterministic Tree (Walking) Automata
• Loops and overloops for tree-walking automata
• Average complexity of Moore's and Hopcroft's algorithms

This page was built for publication: REGAL: A Library to Randomly and Exhaustively Generate Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3503915)