COMPLEXITY OF LIMIT LANGUAGE OF THE ELEMENTARY CELLULAR AUTOMATON OF RULE 22
In this paper, the limit set of the elementary cellular automaton of rule 22 is considered. The limit language is defined from limit set and its complexity is studied by using formal language theory. It is proved that this language is not a regular language. This result shows that the dynamics of th...
Gespeichert in:
| Veröffentlicht in: | Applied Mathematics-A Journal of Chinese Universities 2005-09, Vol.20 (3), p.268-276 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper, the limit set of the elementary cellular automaton of rule 22 is considered. The limit language is defined from limit set and its complexity is studied by using formal language theory. It is proved that this language is not a regular language. This result shows that the dynamics of this cellular automaton is actually complicated. |
|---|---|
| ISSN: | 1005-1031 1993-0445 |
| DOI: | 10.1007/s11766-005-0002-z |