620 search results - page 72 / 124 » Algorithms and computations on cellular automata |
204
click to vote
UPP
2004
Springer
16 years 8 hour ago
2004
Springer
Abstract. This is just a glimpse to the fruitful and constant preoccupation of computer science to try to get inspired by biology, at various levels. Besides briefly discussing th...
135
click to vote
EUROPAR
2007
Springer
16 years 25 days ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
159
click to vote
ICALP
2004
Springer
16 years 1 days ago
2004
Springer
In multi-valued model checking, a temporal logic formula is interpreted relative to a structure not as a truth value but as a lattice element. In this paper we present new algorith...
197
click to vote
LICS
2008
IEEE
16 years 1 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...
165
click to vote
QEST
2008
IEEE
16 years 1 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...