Analytic methods for reachability problems
type: Item
instance of: scholarly article
title: Analytic methods for reachability problems
zbMATH Open document ID: 1477.68159
published in: Journal of Computer and System Sciences
publication date: 2021-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 15B48
Mathematics Subject Classification ID: 47H09
zbMATH DE Number: 7365377
zbMATH Keywords: reachability problems
zbMATH Keywords: Perron-Frobenius theory
zbMATH Keywords: primitive matrix
zbMATH Keywords: synchronizing automata
zbMATH Keywords: functional equation
zbMATH Keywords: contraction
zbMATH Keywords: affine operator
author: Vladimir Yu. Protasov
MaRDI profile type: Publication
full work available at URL: j.jcss.2021.02.007
OpenAlex ID: W3134505533
cites work: Combinatorial properties of irreducible semigroups of nonnegative matrices
cites work: Combinatorial properties of entire semigroups of nonnegative matrices
cites work: A new proof of the Protasov-Voynov theorem on semigroups of nonnegative matrices
cites work: Primitive digraphs with large exponents and slowly synchronizing automata
cites work: Algebraic synchronization criterion and computing reset words
cites work: On primitivity of sets of matrices
cites work: On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs
cites work: Stationary subdivision
cites work: Efficient Algorithms for the Consensus Decision Problem
cites work: Sets of nonnegative matrices with positive inhomogeneous products
cites work: Reset Sequences for Monotonic Automata
cites work: 2D Markov chains
cites work: Directed graphs, 2D state models, and characteristic polynomials of irreducible matrix pairs
cites work: A polynomial matrix approach to the structural properties of 2D positive systems
cites work: Generalized exponents of primitive two-colored digraphs
cites work: Primitive Sets of Nonnegative Matrices and Synchronizing Automata
cites work: Lower bounds for the length of reset words in Eulerian automata
cites work: Generalized primitivity of labeled digraphs
cites work: Q3251743
cites work: On products of non-negative matrices
cites work: Nonhomogeneous matrix products
cites work: Limit theorems for products of positive random matrices
cites work: Lower and upper bounds for the largest Lyapunov exponent of matrices
cites work: Q5606985
cites work: Uniform refinement of curves
cites work: Exponents of tuples of nonnegative matrices
cites work: Definite and Quasidefinite Sets of Stochastic Matrices
cites work: Extremal \(L_p\)-norms of linear operators and self-similar functions
cites work: Semigroups of non-negative matrices
cites work: Classification of \(k\)-primitive sets of matrices
cites work: Asymptotics of products of nonnegative random matrices
cites work: Sets of nonnegative matrices without positive products
cites work: Inhomogeneous Markov Chains
cites work: The concepts of irreducibility and full indecomposability of a matrix in the works of Frobenius, König and Markov
cites work: Q5387708
cites work: Compact noncontraction semigroups of affine operators
cites work: Shortest positive products of nonnegative matrices
cites work: Synchronizing Automata and the Černý Conjecture
cites work: An expansion property of Boolean linear maps
DOI: 10.1016/J.JCSS.2021.02.007
description: scientific article; zbMATH DE number 7365377