The Fixed String of Elementary Cellular Automata
Jiang Zhisong
Department of Mathematics
East China University of Science and Technology
Shanghai 200237
China
zsjiang@ecust.edu.cn
Qin Dakang
School of Science
Nantong University
Nantong 226007
China
qindk@163.com
Abstract
The concepts of a fixed string and a skew fixed string greatly affect a cellular automaton's evolution if its initial configuration contains one or both. Interesting properties are proved using the theory of symbolic dynamics and formal languages. After that, a natural classification of elementary cellular automata is introduced and corresponding classification tables are provided.
