Random deterministic automata with one added transition

Cites work

Asymptotic enumeration of minimal automata
Average case analysis of Brzozowski's algorithm
Average case analysis of Moore's state minimization algorithm
Average complexity of Moore's and Hopcroft's algorithms
Brzozowski algorithm is generically super-polynomial for deterministic automata
Diameter and stationary distribution of random r-out digraphs
Distribution of the number of accessible states in a random deterministic automaton
scientific article; zbMATH DE number 3168330 (Why is no real title available?)
scientific article; zbMATH DE number 3664335 (Why is no real title available?)
scientific article; zbMATH DE number 1024080 (Why is no real title available?)
scientific article; zbMATH DE number 1540669 (Why is no real title available?)
scientific article; zbMATH DE number 7354705 (Why is no real title available?)
scientific article; zbMATH DE number 3190745 (Why is no real title available?)
Limit distributions of certain characteristics of random automaton graphs
On testing for zero polynomials by a set of points with bounded precision.
On the probability of being synchronizable
One drop of non-determinism in a random deterministic automaton
Random deterministic automata
Random graphs.
Short Synchronizing Words for Random Automata
Simplifications of Uniform Expressions Specified by Systems
The Cerny Conjecture Holds with High Probability
The graph structure of a deterministic automaton chosen at random
The probability that k positive integers are pairwise relatively prime
The Tractability Frontier for NFA Minimization

This page was built for publication: Random deterministic automata with one added transition

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