论文信息 - One-Way Cellular Automata on Cayley Graphs

One-Way Cellular Automata on Cayley Graphs

The notion of one-dimensional one-way cellular automata has been introduced to model cellular automata with only a one-way communication between two neighbor cells. In this paper, we generalize this notion to cellular automata working on different communication graphs We present some sufficient conditions for a cellular automaton to be stimulated by a one-way cellular automaton having the same underlying graph, and we give some bounds on the simulation-time of this mimic.

Zsuzsanna Róka | Zsuzsanna Róka

[1] H. Coxeter,et al. Generators and relations for discrete groups , 1957 .

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

[3] Richard A. Duke. The genus, regional number, and Betti number of a graph , 1966 .

[4] A. White. Graphs, Groups and Surfaces , 1973 .

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

[6] Cayley,et al. Desiderata and Suggestions: No. 2. The Theory of Groups: Graphical Representation , 2022 .

[7] W. Burnside,et al. Theory of Groups of Finite Order , 1909 .

[8] Cayley,et al. On the Theory of Groups , 2022 .