Attainable values of reset thresholds
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- A new lower bound for reset threshold of binary synchronizing automata with sink
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- An extremal series of Eulerian synchronizing automata
- Approximation of reset thresholds with greedy algorithms
- Codes and automata.
- Combinatorial matrix theory
- Computing the shortest reset words of synchronizing automata
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- Experiments with Synchronizing Automata
- Generalized exponents of primitive directed graphs
- Local exponents of primitive digraphs
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- On primitivity of sets of matrices
- Primitive digraphs with large exponents and slowly synchronizing automata
- Primitive sets of nonnegative matrices and synchronizing automata
- Reset words for commutative and solvable automata
- Slowly synchronizing automata with zero and noncomplete sets
- Strong inapproximability of the shortest reset word
- Synchronizing Automata and the Černý Conjecture
- Synchronizing Automata with Extremal Properties
- The complexity of finding reset words in finite automata
- The difference between consecutive primes. II
- The index set problem for Boolean (or nonnegative) matrices
- The road coloring problem
- Theory Is Forever
- Černý's conjecture and the road colouring problem
Cited in
(8)- Lower bounds for synchronizing word lengths in partial automata
- On randomized generation of slowly synchronizing automata
- Slowly synchronizing automata with fixed alphabet size
- Extremal synchronizing circular automata
- Černý's conjecture and the road colouring problem
- The Synchronizing Probability Function for Primitive Sets of Matrices
- A new lower bound for reset threshold of binary synchronizing automata with sink
- A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
This page was built for publication: Attainable values of reset thresholds
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111255)
