| COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA |
| |
| 作者姓名： | Qin Dakang Xie Huimin |
| |
| 作者单位： | School of Mathematic Science, Suzhou Univ. , Suzhou 215006, China. |
| |
| 基金项目： | Supported by the Special Funds for Major State Basic Research Projects. |
| |
| 摘 要： | §1Introduction Fromthepointofviewofdynamicalsystemsthecellularautomata(CAs)canbeseen asaclassofinfinitedimensionaldynamicalsystems.OneofthefeaturesofCAsisthatby usingverysimplemappingruleitispossibletoobtainverycomplicatedspatio-temporal patterns.However,itstilllackseffectivemathematicalmethodstosolvetheclassification problemforCAs,ifnotconsideringtheextensivecomputerexperimentasin1,2].Most finelyestablishedrigorousmethodsarerathercoarseandoftendifficulttobeusedin complexityanalysisfornon…
|
| 关 键 词： | 原始细胞 自动控制 时间序列 分析方法 |
| 收稿时间： | 2005-02-04 |
Complexity analysis of time series generated by elementary cellular automata |
| |
| Qin Dakang Xie Huimin.COMPLEXITY ANALYSIS OF TIME SERIES GENERATED BY ELEMENTARY CELLULAR AUTOMATA[J].Applied Mathematics A Journal of Chinese Universities,2005,20(3):253-267. |
| |
| Authors: | Qin Dakang Xie Huimin |
| |
| Institution: | (1) School of Mathematic Science, Suzhou Univ., 215006 Suzhou, China |
| |
| Abstract: | Using the tools of distinct excluded blocks, computational search and symbolic dynamics, the classification problem of all 256 elementary cellular automata is discussed from the point of view of time series generated by them,and examples in each class are provided to explain the methods used. |
| |
| Keywords: | elementary cellular automaton time series distinct excluded block formal language Chomsky hierarchy |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
