Attainable values of reset thresholds

DOI10.4230/LIPICS.MFCS.2017.40zbMATH Open1441.68123OpenAlexW2773056299MaRDI QIDQ5111255FDOQ5111255

Marek Szykuła, Vladimir V. Gusev, Robert Ferens, Michalina Dżyga

Publication date: 26 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.40

Recommendations

• scientific article; zbMATH DE number 7152087
• A new lower bound for reset threshold of binary synchronizing automata with sink
• Synchronizing automata of bounded rank
• Reset thresholds of automata with two cycle lengths
• Reset thresholds of automata with two cycle lengths

zbMATH Keywords

primitive digraphreset wordsynchronizing automatonlocal exponentČerný conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

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
• Title not available (Why is that?)
• 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
• Reset Thresholds of Automata with Two Cycle Lengths
• Title not available (Why is that?)

Cited In (7)

• Title not available (Why is that?)
• Slowly synchronizing automata with fixed alphabet size
• A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices
• Extremal synchronizing circular automata
• Černý's conjecture and the road colouring problem
• The Synchronizing Probability Function for Primitive Sets of Matrices
• Lower Bounds for Synchronizing Word Lengths in Partial Automata

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)