620 search results - page 36 / 124 » Algorithms and computations on cellular automata |
105
Voted
CSR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We study the group-valued and semigroup-valued conservation laws in cellular automata (CA). We provide examples to distinguish between semigroup-valued, group-valued and ...
100
Voted
IMSCCS
2006
IEEE
15 years 6 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
106
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
Any computational approach to design, including the use of evolutionary algorithms, requires the transformation of the domain-specific knowledge into a formal design representatio...
121
Voted
CMSB
2011
Springer
14 years 10 days ago
2011
Springer
Abstract. This paper tackles theoretically the question of the structural stability of biological regulation networks subjected to the influence of their environment. The model of...
121
click to vote
ACRI
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Rule 54, in Wolfram’s notation, is one of elementary yet complexly behaving one-dimensional cellular automata. The automaton supports gliders, glider guns and other non...