Attainable values of reset thresholds
From MaRDI portal
Publication:5111255
DOI10.4230/LIPICS.MFCS.2017.40zbMATH Open1441.68123OpenAlexW2773056299MaRDI QIDQ5111255FDOQ5111255
Authors: Michalina Dżyga, Robert Ferens, Marek Szykuła, Vladimir V. Gusev 
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.40
Recommendations
Cites Work
- Combinatorial matrix theory
- The difference between consecutive primes. II
- Synchronizing Automata and the Černý Conjecture
- Title not available (Why is that?)
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- The complexity of finding reset words in finite automata
- Primitive digraphs with large exponents and slowly synchronizing automata
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- The road coloring problem
- 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
- Codes and automata.
- Generalized exponents of primitive directed graphs
- The index set problem for Boolean (or nonnegative) matrices
- Strong inapproximability of the shortest reset word
- Reset words for commutative and solvable automata
- Title not available (Why is that?)
- Theory Is Forever
- On primitivity of sets of matrices
- Local exponents of primitive digraphs
- Computing the shortest reset words of synchronizing automata
- Synchronizing Automata with Extremal Properties
- Title not available (Why is that?)
- Primitive sets of nonnegative matrices and synchronizing automata
- Slowly synchronizing automata with zero and noncomplete sets
- Experiments with Synchronizing Automata
- Černý's conjecture and the road colouring problem
- An extremal series of Eulerian synchronizing automata
- Approximation of reset thresholds with greedy algorithms
- A new lower bound for reset threshold of binary synchronizing automata with sink
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)
