Abstract
Joint spectral characteristics describe the stationary behavior of a discrete time linear switching system. Well, that’s what an electrical engineer would say. A mathematician would say that they characterize the asymptotic behavior of a semigroup of matrices, and a computer scientist would perhaps see them as describing languages generated by automata.
Work supported by the Communauté française de Belgique - Actions de Recherche Concertées, and by the Belgian Programme on Interuniversity Attraction Poles initiated by the Belgian Federal Science Policy Office.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ahmadi, A.A., Jungers, R.M., Parrilo, P., Roozbehani, M.: Analysis of the joint spectral radius via Lyapunov functions on path-complete graphs. In: Proceedings of: Hybrid Systems: Computation and Control (HSCC 2011), Chicago (2011)
Ahmadi, A.A., Jungers, R.M., Parrilo, P., Roozbehani, M.: When is a set of LMIs a sufficient condition for stability? In: Proceedings of: ROCOND 2012, Aalborg (2012)
Asarin, E., Dima, C.: On the computation of covert channel capacity. RAIRO - Theoretical Informatics and Applications 44(1), 37–58 (2010)
Berstel, J.: Growth of repetition-free words–a review. Theoretical Computer Science 340(2), 280–290 (2005)
Blondel, V.D., Cassaigne, J., Jungers, R.M.: On the number of α-power-free words for 2 < α ≤ 7/3. Theoretical Computer Science 410, 2823–2833 (2009)
Blondel, V.D., Jungers, R., Protasov, V.Y.: On the complexity of computing the capacity of codes that avoid forbidden difference patterns. IEEE Transactions on Information Theory 52(11), 5122–5127 (2006)
Jungers, R.M.: The joint spectral radius, theory and applications. LNCIS, vol. 385. Springer, Heidelberg (2009)
Jungers, R.M., Protasov, V.Y., Blondel, V.D.: Overlap-free words and spectra of matrices. Theoretical Computer Science 410, 3670–3684 (2009)
Karhumäki, J., Shallit, J.: Polynomial versus exponential growth in repetition-free binary words. Journal of Combinatorial Theory Series A 105(2), 335–347 (2004)
Kozyakin, V.A.: Algebraic unsolvability of problem of absolute stability of desynchronized systems. Automation and Remote Control 51, 754–759 (1990)
Liberzon, D.: Switching in Systems and Control. Birkhäuser, Boston (2003)
Moision, B.E., Orlitsky, A., Siegel, P.H.: On codes that avoid specified differences. IEEE Transactions on Information Theory 47, 433–442 (2001)
Parrilo, P.A., Jadbabaie, A.: Approximation of the joint spectral radius of a set of matrices using sum of squares. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 444–458. Springer, Heidelberg (2007)
Protasov, V.Y., Jungers, R.M., Blondel, V.D.: Joint spectral characteristics of matrices: a conic programming approach. SIAM Journal on Matrix Analysis and Applications 31(4), 2146–2162 (2010)
Shorten, R., Wirth, F., Mason, O., Wulff, K., King, C.: Stability criteria for switched and hybrid systems. SIAM Review 49(4), 545–592 (2007)
Tsitsiklis, J.N., Blondel, V.D.: The Lyapunov exponent and joint spectral radius of pairs of matrices are hard- when not impossible- to compute and to approximate. Mathematics of Control, Signals, and Systems 10, 31–40 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jungers, R.M. (2013). Joint Spectral Characteristics: A Tale of Three Disciplines. In: Béal, MP., Carton, O. (eds) Developments in Language Theory. DLT 2013. Lecture Notes in Computer Science, vol 7907. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38771-5_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-38771-5_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38770-8
Online ISBN: 978-3-642-38771-5
eBook Packages: Computer ScienceComputer Science (R0)