Abstract
The Cayley-Hamilton theorem (CHT) is a classic result in linear algebra over fields which states that a matrix satisfies its own characteristic polynomial. CHT has been extended from fields to commutative semirings by Rutherford in 1964. However, to the best of our knowledge, no result is known for noncommutative semirings. This is a serious limitation, as the class of regular languages, with finite automata as their recognizers, is a noncommutative idempotent semiring. In this paper we extend the CHT to noncommutative semirings. We also provide a simpler version of CHT for noncommutative idempotent semirings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Nivat, M., Arnold, A., Dicky, A.: A note about minimal nondeterministic automata. EATCS 45, 166–169 (1992)
Alur, R., Courcoubetis, C., Halbwachs, N., Henzinger, T.A., Ho, P.H., Nicolin, X., Olivero, A., Sifakis, J., Yovine, S.: The algorithmic analysis of hybrid systems. Theoretical Comp. Sci. 138, 3–34 (1995)
Gelfand, I., Gelfand, S., Retakh, V., Wilson, R.L.: Quasideterminants. Adv. Math. 193, 1–82 (2005)
Gondran, M., Minoux, M.: Graphs, Dioids and Semirings. Springer, Heidelberg (2008)
Grosu, R.: Finite automata as time-invariant linear systems: Observability, reachability and more. In: Majumdar, R., Tabuada, P. (eds.) HSCC 2009. LNCS, vol. 5469, pp. 194–208. Springer, Heidelberg (2009)
Kildall, G.A.: A unified approach to global program optimization. In: Proceedings of the 1st Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages POPL 1973, pp. 194–206. ACM, New York (1973)
Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Inf. and Comp. 185(1), 103–157 (2003)
Press, W.H., Teukolsky, S.A., Vetterling, W.T., Flannery, B.P.: Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, New York (1992)
Ree, R.: Lie elements and an algebra associated with shuffles. Anals of Mathematics 67(2), 210–220 (1958)
Rutherford, D.E.: The Cayley-Hamilton theorem for semi-rings. Proc. Roy. Soc. Edinburgh Sect. A 66, 211–215 (1964)
Straubing, H.: A combinatorial proof of the Cayley-Hamilton theorem. Discrete Maths. 43, 273–279 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grosu, R. (2011). The Cayley-Hamilton Theorem for Noncommutative Semirings. In: Domaratzki, M., Salomaa, K. (eds) Implementation and Application of Automata. CIAA 2010. Lecture Notes in Computer Science, vol 6482. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18098-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-18098-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-18097-2
Online ISBN: 978-3-642-18098-9
eBook Packages: Computer ScienceComputer Science (R0)