Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata
From MaRDI portal
Publication:2947417
DOI10.1007/978-3-319-22360-5_13zbMath1465.68147arXiv1512.05881OpenAlexW1467747090MaRDI QIDQ2947417
Jean-Luc Joly, Pierre-Cyrille Héam
Publication date: 23 September 2015
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.05881
Formal languages and automata (68Q45) Combinatorial probability (60C05) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Cites Work
- Enumeration and random generation of accessible automata
- A calculus for the random generation of labelled combinatorial structures
- Random generation of DFAs
- Parametric random generation of deterministic tree automata
- Exact enumeration of acyclic deterministic automata
- Random Deterministic Automata
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Random Generation of Deterministic Acyclic Automata Using Markov Chains
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item