The mortality problem for matrices of low dimensions

DOI10.1007/s00224-002-1010-5zbMath1016.68038OpenAlexW2032155003MaRDI QIDQ1849606

Olivier Bournez, Michael S. Branicky

Publication date: 1 December 2002

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://hal-lara.archives-ouvertes.fr/hal-02101904/file/RR1999-20.pdf

zbMATH Keywords

rational matrices

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (15)

On the decidability of semigroup freeness ⋮ On the decidability and complexity of problems for restricted hierarchical hybrid systems ⋮ Optimization problems involving matrix multiplication with applications in materials science and biology ⋮ Optimal Switching Sequence for Switched Linear Systems ⋮ Explicit construction of a Barabanov norm for a class of positive planar discrete-time linear switched systems ⋮ Flatness and structural analysis as a constructive framework for private communication ⋮ Mortality problem and affine automata ⋮ On undecidability bounds for matrix decision problems ⋮ A survey of computational complexity results in systems and control ⋮ Minimal zero words for second-order matrices ⋮ On the problem of freeness of multiplicative matrix semigroups ⋮ A second-order maximum principle for discrete-time bilinear control systems with applications to discrete-time linear switched systems ⋮ Mortality Problem for 2×2 Integer Matrices ⋮ On Affine Reachability Problems ⋮ REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS

This page was built for publication: The mortality problem for matrices of low dimensions