摘要

This paper studies the limit set of multi-agent system with finite states, in which the system is converted into a linear system through an expansion of space. Then, the structure properties of the system matrix are investigated, and the relationships between the eigenvalues and the limit set are developed. As an application, the nilpotent problem of elementary cellular automata (ECA) known as algorithmically undecidable is considered, and all the nilpotent ECA are found out which consists of rules 0, 8, 64, 239, 253, 255.

全文