An improved algorithm for finding the shortest synchronizing words
From MaRDI portal
Cites work
- A fast algorithm finding the shortest reset words
- A multi-parameter analysis of hard problems on deterministic finite automata
- Algebraic synchronization criterion and computing reset words
- An Efficient Algorithm Finds Noticeable Trends and Examples Concerning the Černy Conjecture
- An improvement to a recent upper bound for synchronizing words of finite automata
- Approximating minimum reset sequences
- Černý's conjecture and the road colouring problem
- Complexity of a problem concerning reset words for Eulerian binary automata
- Computing the shortest reset words of synchronizing automata
- Exact synchronization for finite-state sources
- Experimental study of the shortest reset word of random automata
- Experiments with Synchronizing Automata
- Finding short synchronizing words for prefix codes
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 2040899 (Why is no real title available?)
- scientific article; zbMATH DE number 6861928 (Why is no real title available?)
- scientific article; zbMATH DE number 7152073 (Why is no real title available?)
- scientific article; zbMATH DE number 3222112 (Why is no real title available?)
- Lower bounds for synchronizing word lengths in partial automata
- Model-based testing of reactive systems. Advanced lectures.
- Mortality and synchronization of unambiguous finite automata
- On the probability of being synchronizable
- On two Combinatorial Problems Arising from Automata Theory
- Primitive digraphs with large exponents and slowly synchronizing automata
- Primitive sets of nonnegative matrices and synchronizing automata
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Strong inapproximability of the shortest reset word
- Subset synchronization and careful synchronization of binary finite automata
- Synchronization
- Synchronization and stability of finite automata
- Synchronizing Automata and the Černý Conjecture
- The complexity of finding reset words in finite automata
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas
This page was built for publication: An improved algorithm for finding the shortest synchronizing words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969592)
