620 search results - page 72 / 124 » Algorithms and computations on cellular automata |
122
Voted
UPP
2004
Springer
15 years 6 months 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...
86
Voted
EUROPAR
2007
Springer
15 years 6 months 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...
90
Voted
ICALP
2004
Springer
15 years 6 months 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...
111
Voted
LICS
2008
IEEE
15 years 7 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...
102
click to vote
QEST
2008
IEEE
15 years 7 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...