Random Deterministic Automata
From MaRDI portal
Publication:2921998
DOI10.1007/978-3-662-44522-8_2zbMath1425.68222OpenAlexW2217322393MaRDI QIDQ2921998
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: https://hal-upec-upem.archives-ouvertes.fr/hal-01772890/file/mfcs14.pdf
Analysis of algorithms (68W40) Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (5)
On the Uniform Random Generation of Non Deterministic Automata Up to Isomorphism ⋮ Random Generation and Enumeration of Accessible Deterministic Real-Time Pushdown Automata ⋮ Diameter and stationary distribution of random \(r\)-out digraphs ⋮ On the uniform distribution of regular expressions ⋮ Synchronizing Almost-Group Automata
Cites Work
- The state complexity of random DFAs
- Introducing VAUCANSON
- Average complexity of Moore's and Hopcroft's algorithms
- Enumeration and random generation of accessible automata
- Uniform random generation of decomposable structures using floating-point arithmetic
- A calculus for the random generation of labelled combinatorial structures
- Random generation of DFAs
- Average case analysis of Moore's state minimization algorithm
- Enumeration and generation with a string automata representation
- Asymptotic enumeration of Minimal Automata
- On the Average Complexity of Brzozowski’s Algorithm for Deterministic Automata with a Small Number of Final States
- The transitive closure of a random digraph
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- A Fast Algorithm Finding the Shortest Reset Words
- Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata
- Experimental Evaluation of Classical Automata Constructions
- A Census of Finite Automata
- An Asymptotic Formula for the Differences of the Powers at Zero
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Random Deterministic Automata
