论文信息 - Decision Problems for Cellular Automata and Their Semigroups

Decision Problems for Cellular Automata and Their Semigroups

We associate to every one-dimensional cellular automaton a finitely presented semigroup. This semigroup is shown to have solvable word problem if and only if the common descendant problem is solvable for the cellular automaton. Connections with Culik and Yu's classification of cellular automata are investigated.

John Pedersen

[1] Stephen Wolfram,et al. Theory and Applications of Cellular Automata , 1986 .

[2] Karel Culik,et al. Undecidability of CA Classification Schemes , 1988, Complex Syst..

[3] Alvy Ray Smith,et al. Simple Computation-Universal Cellular Spaces , 1971, JACM.

[4] J. C. Shepherdson,et al. Machine Configuration and Word Problems of Given Degree of Unsolvability , 1965 .

[5] William W. Boone. Word Problems and Recursively Enumerable Degrees of Unsolvability , 1971 .

[6] William W. Boone,et al. Word Problems and Recursively Enumerable Degrees of Unsolvability. A First Paper on Thue Systems , 1966 .

[7] Karel Culik,et al. A Simple Universal Cellular Automaton and its One-Way and Totalistic Version , 1987, Complex Syst..

[8] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.