Enumeration and random generation of accessible automata
From MaRDI portal
Recommendations
- Enumeration and random generation of possibly incomplete deterministic automata
- On the asymptotic enumeration of accessible automata
- Accessible and deterministic automata: enumeration and Boltzmann samplers
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- Random generation of deterministic acyclic automata using the recursive method
- Random generation of deterministic acyclic automata using Markov chains
- scientific article; zbMATH DE number 3934415
- Enumeration and generation with a string automata representation
- Finite automata and randomness
- scientific article; zbMATH DE number 4047127
Cites work
- scientific article; zbMATH DE number 3645067 (Why is no real title available?)
- scientific article; zbMATH DE number 3155303 (Why is no real title available?)
- scientific article; zbMATH DE number 5643878 (Why is no real title available?)
- scientific article; zbMATH DE number 3913686 (Why is no real title available?)
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 4039297 (Why is no real title available?)
- scientific article; zbMATH DE number 2068873 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3324747 (Why is no real title available?)
- scientific article; zbMATH DE number 3356669 (Why is no real title available?)
- A Census of Finite Automata
- A calculus for the random generation of labelled combinatorial structures
- A method and two algorithms on the theory of partitions
- Accessible and deterministic automata: enumeration and Boltzmann samplers
- An Asymptotic Formula for the Differences of the Powers at Zero
- Boltzmann Samplers for the Random Generation of Combinatorial Structures
- Boltzmann sampling of unlabelled structures
- Enumeration of strongly connected sequential machines
- On the Lambert \(w\) function
- Random generation of DFAs
- The state complexities of some basic operations on regular languages
- Uniform random generation of decomposable structures using floating-point arithmetic
Cited in
(31)- On the asymptotic enumeration of accessible automata
- Enumeration and random generation of possibly incomplete deterministic automata
- A hitchhiker's guide to descriptional complexity through analytic combinatorics
- Average case analysis of Moore's state minimization algorithm
- On the uniform random generation of non deterministic automata up to isomorphism
- Generating, sampling and counting subclasses of regular tree languages
- Asymptotic enumeration of minimal automata
- Compacted binary trees admit a stretched exponential
- Distribution of the number of accessible states in a random deterministic automaton
- Enumeration and generation with a string automata representation
- REGAL: A Library to Randomly and Exhaustively Generate Automata
- Sampling different kinds of acyclic automata using Markov chains
- On the average state and transition complexity of finite languages
- Succinct representations for (non)deterministic finite automata
- Random Generation of Deterministic Tree (Walking) Automata
- The method of forced enumeration for nondeterministic automata
- Random generation and enumeration of accessible deterministic real-time pushdown automata
- The state complexity of random DFAs
- scientific article; zbMATH DE number 1775633 (Why is no real title available?)
- Average complexity of Moore's and Hopcroft's algorithms
- Accessible and deterministic automata: enumeration and Boltzmann samplers
- Random generation of deterministic acyclic automata using Markov chains
- Random generation of deterministic acyclic automata using the recursive method
- Parametric random generation of deterministic tree automata
- A large deviations principle for the Maki-Thompson rumour model
- Empirical studies in the size of diagnosers and verifiers for diagnosability analysis
- Enumerating regular expressions and their languages
- Diagnosability verification using LTL model checking
- Succinct representation for (non)deterministic finite automata
- Semicomputable points in Euclidean spaces
- Random deterministic automata
This page was built for publication: Enumeration and random generation of accessible automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q995562)
