scholarly journals Linear Time Language Recognition on Cellular Automata with Restricted Communication

2000 ◽  
pp. 417-426 ◽  
Author(s):  
Thomas Worsch
Keyword(s):  
Cellular Automata ◽  
Linear Time ◽  
Language Recognition

scholarly journals Number conserving cellular automata: new results on decidability and dynamics

2003 ◽  
Vol DMTCS Proceedings vol. AB,... (Proceedings) ◽  
Author(s):  
Bruno Durand ◽  
Enrico Formenti ◽  
Aristide Grange ◽  
Zsuzsanna Róka
Keyword(s):  
Cellular Automata ◽  
Linear Time ◽  
Number Conservation ◽  
International Audience

International audience This paper is a survey on our recent results about number conserving cellular automata. First, we prove the linear time decidability of the property of number conservation. The sequel focuses on dynamical evolutions of number conserving cellular automata.

scholarly journals Representing Reversible Cellular Automata with Reversible Block Cellular Automata

2001 ◽  
Vol DMTCS Proceedings vol. AA,... (Proceedings) ◽  
Author(s):  
Jérôme Durand-Lose
Keyword(s):  
System Theory ◽  
Cellular Automata ◽  
Cellular Automaton ◽  
Linear Time ◽  
Fixed Size ◽  
Mathematical System ◽  
Reversible Cellular Automaton ◽  
International Audience ◽  
Infinite Lattices ◽  
Reversible Cellular Automata

International audience Cellular automata are mappings over infinite lattices such that each cell is updated according tothe states around it and a unique local function.Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks.We prove that any d-dimensional reversible cellular automaton can be exp ressed as thecomposition of d+1 block permutations.We built a simulation in linear time of reversible cellular automata by reversible block cellular automata (also known as partitioning CA and CA with the Margolus neighborhood) which is valid for both finite and infinite configurations. This proves a 1990 conjecture by Toffoli and Margolus <i>(Physica D 45)</i> improved by Kari in 1996 <i>(Mathematical System Theory 29)</i>.

Linear Time Algorithm for Identifying the Invertibility of Null-Boundary Three Neighborhood Cellular Automata

2010 ◽  
Vol 19 (1) ◽  
pp. 89-113 ◽  
Author(s):  
Nirmalya S. Maiti ◽  
Soumyabrata Ghosh ◽  
Shiladitya Munshi ◽  
P. Pal Chaudhuri ◽  
Keyword(s):  
Cellular Automata ◽  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm

scholarly journals Fast reversible language recognition using cellular automata

2008 ◽  
Vol 206 (9-10) ◽  
pp. 1142-1151 ◽  
Author(s):  
Martin Kutrib ◽  
Andreas Malcher
Keyword(s):  
Cellular Automata ◽  
Language Recognition

Parallel language recognition in constant time by cellular automata

1983 ◽  
Vol 19 (4) ◽  
pp. 397-407 ◽  
Author(s):  
R. Sommerhalder ◽  
S. C. van Westrhenen
Keyword(s):  
Cellular Automata ◽  
Constant Time ◽  
Language Recognition ◽  
Parallel Language
Sign in / Sign up

Export Citation Format

Share Document