论文信息 - Computations on one-dimensional cellular automata

Computations on one-dimensional cellular automata

Cellular automata may be viewed as a modelization of synchronous parallel computation. Even in the one-dimensional case, they are known as capable of universal computations. The usual proof uses a simulation of a universal Turing machine. In this paper, we present how a one-dimensional cellular automata can simulate any recursive function in such a way that composition of computations occurs as soon as possible. In addition, this allows us to show that one-dimensional cellular automata may simulate asynchronous computations.

Jacques Mazoyer

[1] Christian Choffrut,et al. On real-time cellular automata and trellis automata , 2004, Acta Informatica.

[2] Charles R. Dyer,et al. One-Way Bounded Cellular Automata , 1980, Inf. Control..

[3] Robert Balzer,et al. An 8-state Minimal Time Solution to the Firing Squad Synchronization Problem , 1967, Inf. Control..

[4] Alvy Ray Smith,et al. Real-Time Language Recognition by One-Dimensional Cellular Automata , 1972, J. Comput. Syst. Sci..

[5] Jacques Mazoyer,et al. A Six-State Minimal Time Solution to the Firing Squad Synchronization Problem , 1987, Theor. Comput. Sci..

[6] Patrick C. Fischer,et al. Generation of Primes by a One-Dimensional Real-Time Iterative Array , 1965, JACM.

[7] Abraham Waksman,et al. An Optimum Solution to the Firing Squad Synchronization Problem , 1966, Inf. Control..

[8] Karel Culik. Variations of the Firing Squad Problem and Applications , 1989, Inf. Process. Lett..

[9] Alvy Ray Smith,et al. Cellular automata theory , 1969 .

[10] Jacques Mazoyer,et al. A Linear Speed-Up Theorem for Cellular Automata , 1992, Theor. Comput. Sci..

[11] Stephen N. Cole. Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[12] A. J. Atrubin. A One-Dimensional Real-Time Iterative Multiplier , 1965, IEEE Trans. Electron. Comput..