495 search results - page 48 / 99 » Automata and differentiable words |
184
click to vote
TCS
2011
15 years 24 days ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
221
click to vote
UMC
2000
15 years 9 months ago
2000
Abstract. We consider various extensions and modifications of Shannon's General Purpose Analog Computer, which is a model of computation by differential equations in continuou...
142
click to vote
FORMATS
2009
Springer
16 years 12 days ago
2009
Springer
In this paper, we focus on the synthesis of secure timed systems which are given by timed automata. The security property that the system must satisfy is a non-interference propert...
152
click to vote
WIA
2007
Springer
15 years 12 months ago
2007
Springer
We study the pattern statistics representing the number of occurrences of a given string in a word of length n generated at random by rational stochastic models, defined by means ...
159
click to vote
CAV
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present the features of Romeo, a Time Petri Net (TPN) analyzer. The tool Romeo allows state space computation of TPN and on-the-fly model-checking of reachabilit...