Sciweavers

HYBRID
2009
Springer
13 years 11 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu