2 search results - page 1 / 1 » Time Granularities and Ultimately Periodic Automata |
JELIA
2004
Springer
13 years 10 months ago
2004
Springer
FORMATS
2007
Springer
13 years 11 months ago
2007
Springer
We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal l...