Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
From MaRDI portal
Publication:5885810
DOI10.1137/22M1471535OpenAlexW4323656813MaRDI QIDQ5885810
Publication date: 30 March 2023
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/22m1471535
Formal languages and automata (68Q45) Positive matrices and their generalizations; cones of matrices (15B48) Groups and semigroups of linear operators (47D03) Canonical forms, reductions, classification (15A21) Descriptive complexity and finite models (68Q19)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- The road coloring problem
- A polynomial matrix approach to the structural properties of 2D positive systems
- On primitivity of sets of matrices
- 2D Markov chains
- When do several linear operators share an invariant cone?
- Non-negative matrices and Markov chains. 2nd ed
- An extremal problem for two families of sets
- Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs
- Synchronizing finite automata on Eulerian digraphs.
- Zeta functions of finite graphs and coverings. II
- Computational complexity of certain problems related to carefully synchronizing words for partial automata and directing words for nondeterministic automata
- Generalized primitivity of labeled digraphs
- Adventures between lower bounds and higher altitudes. Essays dedicated to Juraj Hromkovič on the occasion of his 60th birthday
- Exponents of tuples of nonnegative matrices
- The Hamiltonian numbers in digraphs
- Analytic methods for reachability problems
- Černý's conjecture and the road colouring problem
- Elementary abelian regular coverings of Platonic maps
- Primitivity and synchronizing automata: a functional analytic approach
- A new proof of the Protasov-Voynov theorem on semigroups of nonnegative matrices
- Shortest positive products of nonnegative matrices
- Unzerlegbare, nicht negative Matrizen
- An Expansion Property of Boolean Linear Maps
- LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA
- Classification of $k$-Primitive Sets of Matrices
- Strong Inapproximability of the Shortest Reset Word
- A NOTE ON SYNCHRONIZED AUTOMATA AND ROAD COLORING PROBLEM
- Primitive Sets of Nonnegative Matrices and Synchronizing Automata
- Self-affine polytopes. Applications to functional equations and matrix theory
- General Irreducible Markov Chains and Non-Negative Operators
- Compact noncontraction semigroups of affine operators
- Synchronizing Automata and the Černý Conjecture
- On two Combinatorial Problems Arising from Automata Theory
- Asymptotic estimate of the length of a diagnostic word for a finite automaton
- On the Road Coloring Problem
- An improvement to a recent upper bound for synchronizing words of finite automata
- Digraphs
- Depth-First Search and Linear Graph Algorithms
- Representation Theory
This page was built for publication: Primitivity and Hurwitz Primitivity of Nonnegative Matrix Tuples: A Unified Approach
