The mortality problem for matrices of low dimensions
From MaRDI portal
Recommendations
Cited in
(20)- Flatness and structural analysis as a constructive framework for private communication
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- 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
- On undecidability bounds for matrix decision problems
- Minimal zero words for second-order matrices
- When is a pair of matrices mortal?
- On the decidability of semigroup freeness.
- Mortality for 2 2 matrices is NP-hard
- On the decidability and complexity of problems for restricted hierarchical hybrid systems
- Recursive Solvability of Problems with Matrices
- Explicit construction of a Barabanov norm for a class of positive planar discrete-time linear switched systems
- On Affine Reachability Problems
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond
- Optimal Switching Sequence for Switched Linear Systems
- Mortality Problem for 2×2 Integer Matrices
- REACHABILITY PROBLEMS FOR PRODUCTS OF MATRICES IN SEMIRINGS
- A survey of computational complexity results in systems and control
- Optimization problems involving matrix multiplication with applications in materials science and biology
- Mortality problem and affine automata
This page was built for publication: The mortality problem for matrices of low dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849606)
