Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
From MaRDI portal
Recommendations
- Finite Automata and the Analysis of Infinite Transition Systems
- Automata and temporal logic over arbitrary linear time
- scientific article; zbMATH DE number 139828
- scientific article; zbMATH DE number 1501077
- Finite automata-models for the investigation of dynamical systems
- Finite automata on timed \(\omega\)-trees
- Finite automata, real time processes and counting problems in bounded arithmetics
- scientific article; zbMATH DE number 7297846
- scientific article; zbMATH DE number 5024617
- Linear realization of finite automata
Cites work
- Graphs, dioids and semirings. New models and algorithms.
- scientific article; zbMATH DE number 46143 (Why is no real title available?)
- scientific article; zbMATH DE number 58314 (Why is no real title available?)
- scientific article; zbMATH DE number 3307592 (Why is no real title available?)
- scientific article; zbMATH DE number 3366846 (Why is no real title available?)
- Hybrid I/O automata.
- Linear preservers of extremes of rank inequalities over semirings: Row and column ranks
- Optimization of LR(k) parsers
- The algorithmic analysis of hybrid systems
Cited in
(3)
This page was built for publication: Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3624572)