A4 Vertaisarvioitu artikkeli konferenssijulkaisussa
On the Joint Spectral Radius for Bounded Matrix Languages
Tekijät: Bell Paul C, Halava Vesa, Hirvensalo Mika
Julkaisuvuosi: 2010
Journal: Lecture Notes in Computer Science
Tietokannassa oleva lehden nimi: REACHABILITY PROBLEMS
Lehden akronyymi: LECT NOTES COMPUT SC
Vuosikerta: 6227
Aloitussivu: 91
Lopetussivu: 103
Sivujen määrä: 2
ISBN: 978-3-642-15348-8
ISSN: 0302-9743
Tiivistelmä
This has an interpretation in terms of a control problem for a switched linear system with a fixed and finite number of switching operations; if we fix the maximum number of switching operations in advance, then determining convergence to the origin for all initial points is decidable whereas determining boundedness of all initial points is undecidable.
This has an interpretation in terms of a control problem for a switched linear system with a fixed and finite number of switching operations; if we fix the maximum number of switching operations in advance, then determining convergence to the origin for all initial points is decidable whereas determining boundedness of all initial points is undecidable.
Turun yliopiston Tutkimustietojärjestelmän portaali