Random generation of deterministic acyclic automata using the recursive method

DOI10.1007/978-3-642-38536-0_8MaRDI QIDQ4928475zbMATH OpenOpenAlexFDO

Authors Sven De Felice, Cyril Nicaud

Publication date 14 June 2013

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-38536-0_8

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Random generation of deterministic acyclic automata using Markov chains
• Sampling different kinds of acyclic automata using Markov chains
• Enumeration and random generation of possibly incomplete deterministic automata
• Accessible and deterministic automata: enumeration and Boltzmann samplers
• Enumeration and random generation of accessible automata

Cited in

(10)

• Random generation of DFAs
• Parametric random generation of deterministic tree automata
• A quadratic algorithm for road coloring
• Random generation and enumeration of accessible deterministic real-time pushdown automata
• Enumeration and random generation of possibly incomplete deterministic automata
• REGAL: A Library to Randomly and Exhaustively Generate Automata
• Random Generation of Deterministic Tree (Walking) Automata
• Sampling different kinds of acyclic automata using Markov chains
• Random generation of deterministic acyclic automata using Markov chains
• Enumeration and random generation of accessible automata

This page was built for publication: Random generation of deterministic acyclic automata using the recursive method

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