1246 search results - page 43 / 250 » Recursive Timed Automata |
96
Voted
FMOODS
2006
15 years 2 months ago
2006
Long-Running transactions consist of tasks which may be executed sequentially and in parallel, may contain sub-tasks, and may require to be completed before a deadline. These trans...
107
click to vote
HYBRID
2009
Springer
15 years 7 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...
101
Voted
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
IFIP
2004
Springer
15 years 6 months ago
2004
Springer
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We ...
101
Voted
FOSSACS
2004
Springer
15 years 6 months ago
2004
Springer
In this work we generalize the fundamental notion of recognizability from untimed to timed languages. The essence of our definition is the existence of a right-morphism from the m...