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

Kernel of a class of automata indistinguishable by a simple experiment

โœ Scribed by G. G. Ponomarenko

Publisher
Springer US
Year
1987
Tongue
English
Weight
723 KB
Volume
23
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Cyclic linear differential automata: a s
Cyclic linear differential automata: a simple class of hybrid dynamical systems
โœ 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

A new class of automata networks
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

A class of linear automata on graphs
A class of linear automata on graphs
โœ A. G. Rutkas; D. M. Chausovskii ๐Ÿ“‚ Article ๐Ÿ“… 1972 ๐Ÿ› Springer US ๐ŸŒ English โš– 406 KB
On a class of kernel-perfect and kernel-
On a class of kernel-perfect and kernel-perfect-critical graphs
โœ Kiran B. Chilakamarri; Peter Hamburger ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 275 KB

Chilakamarri, K.B. and P. Hamburger, On a class of kernel-perfect and kernel-perfect-critical graphs, Discrete Mathematics 118 (1993) 253-257. In this note we present a construction of a class of graphs in which each of the graphs is either kernel-perfect or kernel-perfect-critical. These graphs or