Finite Automata as Time-Inv Linear Systems Observability, Reachability and More

DOI10.1007/978-3-642-00602-9_14zbMath1237.93110OpenAlexW1535531066MaRDI QIDQ3624572

Radu Grosu

Publication date: 30 April 2009

Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00602-9_14

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Discrete-time control/observation systems (93C55) Observability (93B07) Attainable sets, reachability (93B03)

Related Items (1)

The Cayley-Hamilton Theorem for Noncommutative Semirings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Linear preservers of extremes of rank inequalities over semirings: Row and column ranks
• Hybrid I/O automata.
• Graphs, dioids and semirings. New models and algorithms.
• Optimization of LR(k) parsers

This page was built for publication: Finite Automata as Time-Inv Linear Systems Observability, Reachability and More