A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Positive matrices and their generalizations; cones of matrices (15B48) Algebraic theory of languages and automata (68Q70) Algebraic systems of matrices (15A30)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Combinatorial properties of irreducible semigroups of nonnegative matrices
Primitive digraphs with large exponents and slowly synchronizing automata
Sets of nonnegative matrices without positive products
Shortest synchronizing strings for Huffman codes
Synchronizing automata preserving a chain of partial orders
On primitivity of sets of matrices
Non-negative matrices and Markov chains. 2nd ed
An extremal problem for two families of sets
Limit theorems for products of positive random matrices
Reset words for commutative and solvable automata
Synchronizing finite automata on Eulerian digraphs.
The synchronizing probability function for primitive sets of matrices
The complexity of oblivious plans for orienting and distinguishing polygonal parts
A Linear Bound on the k-rendezvous time for primitive sets of NZ matrices
On the interplay between Babai and Černý's conjectures
On the Synchronizing Probability Function and the Triple Rendezvous Time
Experiments with Synchronizing Automata
Strong Inapproximability of the Shortest Reset Word
Synchronizing Automata with Extremal Properties
Invariant functions for the Lyapunov exponents of random matrices
Primitive Sets of Nonnegative Matrices and Synchronizing Automata
Notable trends concerning the synchronization of graphs and automata
Reset Sequences for Monotonic Automata
Synchronizing Automata and the Černý Conjecture
The Averaging Trick and the Černý Conjecture
On two Combinatorial Problems Arising from Automata Theory
On products of non-negative matrices
Primitivity and Local Primitivity of Digraphs and Nonnegative Matrices
Decidability of the Membership Problem for 2 × 2 integer matrices
Approximation of Reset Thresholds with Greedy Algorithms
Attainable Values of Reset Thresholds
On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs
An improvement to a recent upper bound for synchronizing words of finite automata
Lower Bounds for Synchronizing Word Lengths in Partial Automata
Unsolvability in 3 × 3 Matrices
The Synchronizing Probability Function for Primitive Sets of Matrices

This page was built for publication: A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices