A class of linear automata on graphs
โ Scribed by A. G. Rutkas; D. M. Chausovskii
- Publisher
- Springer US
- Year
- 1972
- Tongue
- English
- Weight
- 406 KB
- Volume
- 5
- Category
- Article
- ISSN
- 1573-8337
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We introduce a special class of hybrid dynamical systems: cyclic linear di!erential automata (CLDA). We show that any CLDA can be reduced to a linear discrete-time system with periodic coe$cients. Any CLDA has no equilibrium points. Therefore, the simplest attractor in such system is a periodic traj
A class of machines modelled as deterministic Moore automata is proposed. Particular attention is given to investigating their capability of exhibiting learning behaviour assessed by an associated index of performance. This is done by assuming that the automata are operating in a random environment
A new class of automata networks is defined. Their evolution rules are determined by a probability measure p on the set of all integers 7/and an indicator function IA on the interval [0, 1]. It is shown that any cellular automaton rule can be represented b3 a (nonunique) rule formulated in terms of