Sciweavers

367 search results - page 17 / 74
» Amalgamation of cellular automata
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods
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...
Martin Delacourt, Victor Poupet
SIAMCOMP
2002
153views more  SIAMCOMP 2002»
13 years 7 months ago
A Decision Procedure for Unitary Linear Quantum Cellular Automata
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
Christoph Dürr, Miklos Santha
TCS
2011
13 years 2 months ago
On the relationship between fuzzy and Boolean cellular automata
Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification" of the local rule of a corresponding Boolean cellula...
Heather Betel, Paola Flocchini
JAC
2008
13 years 8 months ago
Quantization of cellular automata
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...
Pablo Arrighi, Vincent Nesme
LATIN
1995
Springer
13 years 11 months ago
Reversible Cellular Automaton Able to Simulate Any Other Reversible One Using Partitioning Automata
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...
Jérôme Olivier Durand-Lose