620 search results - page 62 / 124 » Algorithms and computations on cellular automata |
103
click to vote
CONCUR
2000
Springer
15 years 5 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
CAV
2006
Springer
15 years 4 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...
114
Voted
ARCS
2008
Springer
15 years 2 months ago
2008
Springer
: The task of the creatures in the "creatures' exploration problem" is to visit all empty cells in an environment with a minimum number of steps. We have analyzed th...
110
Voted
MFCS
2009
Springer
15 years 7 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We deļ...
125
Voted
DIS
2000
Springer
15 years 5 months ago
2000
Springer
Given two sets of strings, consider the problem to ļ¬nd a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...