Anticipating the Filtrons of Automata by Complex Discrete Systems Analysis

摘要

Filtrons of automata are coherent structures (discrete solitons) supported by iterated automata maps (IAMs). They differ from signals of cellular automata. The signals emerge during parallel processing of strings, while IAMs transform strings in serial. We relate the filtron and its supporting automaton with a particular complex discrete system (CDS). This CDS has the form of a processing ring net. Its computation is characterized by four components: instructions of processing nodes (I), inter-processor communication constraints (C), initial data (D), and synchronization (S). We present an analysis of a computation performed within this CDS. It is useful in the problems of searching for any of the mentioned four components assuming that remaining three are known. We give a technique of anticipating the filtrons with a desired parameter C when I, S and D are given. We show how to decide the synchronization S when I, C and D are assumed, and how to determine instructions I when the desired filtron is described by known C, D and S.