论文信息 - Reduced power automata

Reduced power automata

We describe a class of transitive semiautomata whose power automata are reduced: any two reachable sets of states have distinct behavior. These automata appear naturally in the study of one-dimensional cellular automata.

Klaus Sutner

[1] S. Wolfram. Twenty Problems in the Theory of Cellular Automata , 1985 .

[2] B. Weiss. Subshifts of finite type and sofic systems , 1973 .

[3] Klaus Sutner,et al. The size of power automata , 2003, Theor. Comput. Sci..

[4] Klaus Sutner,et al. Linear Cellular Automata and Fischer Automata , 1997, Parallel Comput..

[5] Roland Fischer. Sofic systems and graphs , 1975 .

[6] Dominique Perrin,et al. Symbolic Dynamics and Finite Automata , 1997, Handbook of Formal Languages.

[7] M. Delorme,et al. Cellular automata : a parallel model , 1999 .

[8] Eric Badouel. Representations of Reversible Automata and State Graphs of Vector Addition Systems , 1998 .

[9] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .

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

[11] Klaus Sutner,et al. De Bruijn Graphs and Linear Cellular Automata , 1991, Complex Syst..

[12] Danièle Beauquier. Minimal Automaton for a Factorial, Transitive and Rational Language , 1989, Theor. Comput. Sci..

[13] Klaus Sutner,et al. Linear Cellular Automata and de Bruijn Automata , 1999 .

[14] Stephen Wolfram,et al. A New Kind of Science , 2003, Artificial Life.