Random deterministic automata
From MaRDI portal
Publication:2921998
Recommendations
- Distribution of the number of accessible states in a random deterministic automaton
- Average case analysis of Moore's state minimization algorithm
- Average case analysis of Brzozowski's algorithm
- On the average complexity of Brzozowski's algorithm for deterministic automata with a small number of final states
- Enumeration and random generation of possibly incomplete deterministic automata
Cites work
- scientific article; zbMATH DE number 3645067 (Why is no real title available?)
- scientific article; zbMATH DE number 3978019 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3748431 (Why is no real title available?)
- scientific article; zbMATH DE number 16479 (Why is no real title available?)
- scientific article; zbMATH DE number 3460178 (Why is no real title available?)
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- scientific article; zbMATH DE number 1418342 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3189697 (Why is no real title available?)
- A Census of Finite Automata
- A calculus for the random generation of labelled combinatorial structures
- A fast algorithm finding the shortest reset words
- An Asymptotic Formula for the Differences of the Powers at Zero
- Analytic combinatorics
- Asymptotic enumeration of minimal automata
- Average case analysis of Moore's state minimization algorithm
- Average complexity of Moore's and Hopcroft's algorithms
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Brzozowski algorithm is generically super-polynomial for deterministic automata
- Distribution of the number of accessible states in a random deterministic automaton
- Enumeration and generation with a string automata representation
- Enumeration and random generation of accessible automata
- Experimental Evaluation of Classical Automata Constructions
- Introducing VAUCANSON
- On the asymptotic enumeration of accessible automata
- On the average complexity of Brzozowski's algorithm for deterministic automata with a small number of final states
- On the average complexity of Moore's state minimization algorithm
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Random generation of DFAs
- Random graphs.
- The state complexity of random DFAs
- The transitive closure of a random digraph
- Uniform random generation of decomposable structures using floating-point arithmetic
Cited in
(14)- On the uniform distribution of regular expressions
- Automata recognizing no words: a statistical approach
- scientific article; zbMATH DE number 777287 (Why is no real title available?)
- Non-deterministic Weighted Automata on Random Words
- On the uniform random generation of non deterministic automata up to isomorphism
- Distribution of the number of accessible states in a random deterministic automaton
- Random generation of DFAs
- Diameter and stationary distribution of random \(r\)-out digraphs
- The graph structure of a deterministic automaton chosen at random
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Finitely nonstationary nondeterministic automata with random input
- Synchronizing almost-group automata
- Brzozowski algorithm is generically super-polynomial for deterministic automata
- Asymptotic enumeration of minimal automata
This page was built for publication: Random deterministic automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2921998)
