1246 search results - page 135 / 250 » Recursive Timed Automata |
131
Voted
COCO
1995
Springer
15 years 8 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
157
click to vote
STRINGOLOGY
2004
15 years 6 months ago
2004
Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar three-step approach, based on an initial di...
154
Voted
DBPL
2007
Springer
15 years 11 months ago
2007
Springer
Macro tree transducers (mtt) are an important model that both covers many useful XML transformations and allows decidable exact typechecking. This paper reports our first step tow...
188
click to vote
CONCUR
2006
Springer
15 years 7 months ago
2006
Springer
Propositional temporal logic is not suitable for expressing properties on the evolution of dynamically allocated entities over time. In particular, it is not possible to trace such...
138
click to vote
IMECS
2007
15 years 6 months ago
2007
— ACPsrt hs is a hybrid process algebra obtained by extending a combination of two existing extensions of Algebra of Communicating Processes (ACP), namely the process algebra wit...