367 search results - page 21 / 74 » Time-Symmetric Cellular Automata |
124
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
124
click to vote
ICGI
2010
Springer
15 years 2 months ago
2010
Springer
In this work, we give an algorithm that infers Regular Trace Languages. Trace languages can be seen as regular languages that are closed under a partial commutation relation called...
130
click to vote
MFCS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper we study language recognition by two-dimensional cellular automata on different possible neighborhoods. Since it is known that all complete neighborhoods are linearl...
119
click to vote
JAC
2008
15 years 3 months ago
2008
Take a cellular automaton, consider that each configuration is a basis vector in some vector space, and linearize the global evolution function. If lucky, the result could actually...
119
Voted
LATIN
1995
Springer
15 years 5 months ago
1995
Springer
Partitioning automata (PA) are de ned. They are equivalent to cellular automata (CA). Reversible sub-classes are also equivalent. A simple, reversible and universal partitioning au...