4 search results - page 1 / 1 » Counter-Free Input-Determined Timed Automata |
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...
FSTTCS
2006
Springer
13 years 8 months ago
2006
Springer
We consider a general class of timed automata parameterized by a set of "input-determined" operators, in a continuous time setting. We show that for any such set of opera...
FORMATS
2004
Springer
13 years 10 months ago
2004
Springer
WWW
2007
ACM
14 years 5 months ago
2007
ACM
We propose the study of visibly pushdown automata (Vpa) for processing XML documents. Vpas are pushdown automata where the input determines the stack operation, and XML documents ...