Sciweavers

13 search results - page 2 / 3
» Traced communication complexity of cellular automata
Sort
View
FUIN
2007
114views more  FUIN 2007»
13 years 6 months ago
Cellular Devices and Unary Languages
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
Andreas Klein, Martin Kutrib
ENTCS
2002
143views more  ENTCS 2002»
13 years 5 months ago
Collecting Statistics over Runtime Executions
Abstract. We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics ove...
Bernd Finkbeiner, Sriram Sankaranarayanan, Henny S...
CONEXT
2007
ACM
13 years 10 months ago
A hybrid finite automaton for practical deep packet inspection
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
Michela Becchi, Patrick Crowley
PARELEC
2006
IEEE
14 years 1 days ago
Building Mini-Grid Environments with Virtual Private Networks: A Pragmatic Approach
At our university, we have a number of small-tomedium-size compute clusters and some technical simulations which could benefit from using several of these clusters simulaneously....
Christian Kauhaus, Dietmar Fey
DAGSTUHL
2007
13 years 7 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis