๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Cyclic linear differential automata: a s
โœ Andrey V. Savkin; Alexey S. Matveev ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 201 KB

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

On a class of automata models of learnin
โœ G. Langholz ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Elsevier Science โš– 311 KB

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
โœ Nino Boccara; Henryk Fukล›; Servie Geurten ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 452 KB

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