A linear bound on the k-rendezvous time for primitive sets of NZ matrices
From MaRDI portal
Publication:5158650
Recommendations
- A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices
- Primitive sets of nonnegative matrices and synchronizing automata
- On primitivity of sets of matrices
- The synchronizing probability function for primitive sets of matrices
- The Synchronizing Probability Function for Primitive Sets of Matrices
Cites work
- A counter example to a conjecture concerning synchronizing words in finite automata
- A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices
- A note on homogeneous experiments with finite automata
- A remark about homogeneous experiments
- An extremal problem for two families of sets
- An improvement to a recent upper bound for synchronizing words of finite automata
- Approximation of reset thresholds with greedy algorithms
- Attainable values of reset thresholds
- Combinatorial properties of irreducible semigroups of nonnegative matrices
- Decidability of the membership problem for \(2\times 2\) integer matrices
- Experiments with Synchronizing Automata
- scientific article; zbMATH DE number 7228447 (Why is no real title available?)
- scientific article; zbMATH DE number 1346363 (Why is no real title available?)
- scientific article; zbMATH DE number 7152073 (Why is no real title available?)
- scientific article; zbMATH DE number 3266647 (Why is no real title available?)
- scientific article; zbMATH DE number 3354928 (Why is no real title available?)
- Invariant functions for the Lyapunov exponents of random matrices
- Limit theorems for products of positive random matrices
- Lower bounds for synchronizing word lengths in partial automata
- Non-negative matrices and Markov chains. 2nd ed
- Nonhomogeneous matrix products
- Notable trends concerning the synchronization of graphs and automata
- On primitivity of sets of matrices
- On products of non-negative matrices
- On random primitive sets, directable NFAs and the generation of slowly synchronizing DFAs
- On randomized generation of slowly synchronizing automata
- On the interplay between Babai and Černý's conjectures
- On the synchronizing probability function and the triple rendezvous time. New approaches to Černý's conjecture
- 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
- Primitivity and local primitivity of digraphs and nonnegative matrices
- Reset Sequences for Monotonic Automata
- Reset words for commutative and solvable automata
- Sets of nonnegative matrices without positive products
- Shortest synchronizing strings for Huffman codes
- Strong inapproximability of the shortest reset word
- Synchronizing Automata and the Černý Conjecture
- Synchronizing automata preserving a chain of partial orders
- Synchronizing Automata with Extremal Properties
- Synchronizing finite automata on Eulerian digraphs.
- The averaging trick and the Černý conjecture
- The complexity of oblivious plans for orienting and distinguishing polygonal parts
- The synchronizing probability function for primitive sets of matrices
- The Synchronizing Probability Function for Primitive Sets of Matrices
- Unsolvability in 3 × 3 Matrices
Cited in
(2)
This page was built for publication: A linear bound on the \(k\)-rendezvous time for primitive sets of NZ matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158650)
