3653 search results - page 35 / 731 » On Recognizable Timed Languages |
166
click to vote
LICS
2010
IEEE
15 years 3 months ago
2010
IEEE
Alternating timed automata are a powerful extension of classical Alur-Dill timed automata that are closed under all Boolean operations. They have played a key role, among others, ...
107
Voted
ER
2009
Springer
15 years 11 months ago
2009
Springer
106
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
106
Voted
PPDP
2005
Springer
15 years 10 months ago
2005
Springer
111
Voted
SIGADA
2004
Springer
15 years 10 months ago
2004
Springer
