2 search results - page 1 / 1 » Finite Automata as Time-Inv Linear Systems Observability, Re... |
HYBRID
2009
Springer
15 years 5 months ago
2009
Springer
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...
77
Voted
ENTCS
2006
14 years 10 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...