Pages that link to "Item:Q2483266"
From MaRDI portal
The following pages link to Efficient algorithms for deciding the type of growth of products of integer matrices (Q2483266):
Displayed 21 items.
- Linear switching systems with slow growth of trajectories (Q254633) (← links)
- Spectral simplex method (Q263213) (← links)
- Growth degree classification for finitely generated semigroups of integer matrices (Q284638) (← links)
- Lower bounds on complexity of Lyapunov functions for switched linear systems (Q286067) (← links)
- Matrix semigroups with constant spectral radius (Q344918) (← links)
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers (Q355379) (← links)
- Sets of nonnegative matrices without positive products (Q426069) (← links)
- On asymptotic properties of matrix semigroups with an invariant cone (Q442681) (← links)
- On the marginal instability of linear switched systems (Q450818) (← links)
- Observable graphs (Q548270) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- Resonance and marginal instability of switching systems (Q894302) (← links)
- Exact computation of joint spectral characteristics of linear operators (Q1946589) (← links)
- Matrix products with constraints on the sliding block relative frequencies of different factors (Q2250770) (← links)
- On infinite words determined by L systems (Q2354759) (← links)
- On the asymptotic regularity of a family of matrices (Q2427905) (← links)
- On the finiteness property for rational matrices (Q2483265) (← links)
- The Euler binary partition function and subdivision schemes (Q2967973) (← links)
- Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems (Q3014928) (← links)
- FINDING THE GROWTH RATE OF A REGULAR OR CONTEXT-FREE LANGUAGE IN POLYNOMIAL TIME (Q3586406) (← links)
- On the computation of covert channel capacity (Q5190077) (← links)