Attainable Values of Reset Thresholds
From MaRDI portal
Publication:5111255
DOI10.4230/LIPIcs.MFCS.2017.40zbMath1441.68123OpenAlexW2773056299MaRDI QIDQ5111255
Marek Szykuła, Robert Ferens, Michalina Dżyga, Vladimir V. Gusev
Publication date: 26 May 2020
Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.40
Related Items (7)
Unnamed Item ⋮ Lower Bounds for Synchronizing Word Lengths in Partial Automata ⋮ A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primitive digraphs with large exponents and slowly synchronizing automata
- The road coloring problem
- On primitivity of sets of matrices
- The index set problem for Boolean (or nonnegative) matrices
- Local exponents of primitive digraphs
- Reset words for commutative and solvable automata
- Černý's conjecture and the road colouring problem
- Computing the shortest reset words of synchronizing automata
- Slowly synchronizing automata with zero and noncomplete sets
- The Difference Between Consecutive Primes, II
- An Extremal Series of Eulerian Synchronizing Automata
- Experiments with Synchronizing Automata
- Strong Inapproximability of the Shortest Reset Word
- Synchronizing Automata with Extremal Properties
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata
- Lower Bounds for the Length of Reset Words in Eulerian Automata
- Reset Thresholds of Automata with Two Cycle Lengths
- Generalized exponents of primitive directed graphs
- Synchronizing Automata and the Černý Conjecture
- The Complexity of Finding Reset Words in Finite 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
- Approximation of Reset Thresholds with Greedy Algorithms
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- Theory Is Forever
This page was built for publication: Attainable Values of Reset Thresholds
