The Cayley-Hamilton Theorem for Noncommutative Semirings
From MaRDI portal
Publication:3073632
DOI10.1007/978-3-642-18098-9_16zbMath1296.16060OpenAlexW1556161956MaRDI QIDQ3073632
Publication date: 11 February 2011
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_16
Determinants, permanents, traces, other special matrix functions (15A15) Algebraic theory of languages and automata (68Q70) Semirings (16Y60)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The algorithmic analysis of hybrid systems
- Lie elements and an algebra associated with shuffles
- A combinatorial proof of the Cayley-Hamilton theorem
- Hybrid I/O automata.
- Quasideterminants
- Graphs, dioids and semirings. New models and algorithms.
- Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
This page was built for publication: The Cayley-Hamilton Theorem for Noncommutative Semirings