Abstract

Cellular automata, a class of discrete dynamical systems, show a wide range of dynamic behavior, some very complex despite the simplicity of the system's definition. This range of behavior can be organized into six classes, according to the Li-Packard system: null, fixed point, two-cycle, periodic, complex, and chaotic. An advanced method for automatically classifying cellular automata into these six classes is presented. Seven parameters were used for automatic classification, six from existing literature and one newly presented. These seven parameters were used in conjunction with neural networks to automatically classify an average of 98.3% of elementary cellular automata and 93.9% of totalistic k = 2 r = 3 cellular automata. In addition, the seven parameters were ranked based on their effectiveness in classifying cellular automata into the six Li-Packard classes.

Library of Congress Subject Headings

Cellular automata--Classification

Publication Date

2003

Document Type

Thesis

Student Type

Graduate

Degree Name

Computer Science (MS)

Department, Program, or Center

Computer Science (GCCIS)

Advisor

Roger Gaborski

Advisor/Committee Member

Peter Anderson

Advisor/Committee Member

Julie Adams

Comments

Physical copy available from RIT's Wallace Library at QA267.5.C45 K85 2003

Campus

RIT – Main Campus

Download

Share

COinS