Showing papers on "Continuous automaton published in 1976"
TL;DR: This paper extends their theory to a linear space automaton, i.e., a linear system with more than one linear mapping, to obtain a necessary and sufficient condition that it is strongly stable.
Abstract: Paz et al. [1] have revealed the necessary and sufficient conditions for a linear automaton to be strongly approximable. In this paper, we extend their theory to a linear space automaton [2], i.e., a linear system with more than one linear mapping, to obtain a necessary and sufficient condition that it is strongly stable.
5 citations
06 Sep 1976
TL;DR: In this work, certain decompositions of a finite automaton are studied in relationship with the factorisations of a polynomial associated to it.
Abstract: We study certain decompositions of a finite automaton in relationship with the factorisations of a polynomial associated to it.
4 citations
TL;DR: For certain one-dimensional growth rules, the limiting “shapes” of the crystals are computed, and an asymptotic formula for the size of the crystal as a function of time is obtained.
Abstract: The transition ruleF of a cellular automaton may sometimes be regarded as a “rule of growth” of a crystal from a “seed”ω. A study is made of the iteratesω,Fω,F2ω⋯.For certain one-dimensional growth rules, the limiting “shapes” of the crystals are computed, and an asymptotic formula for the size of the crystal as a function of time is obtained.
4 citations
TL;DR: It is shown that a one-dimensional bounded cellular automaton can simulate a linear-bounded automaton (LBA) in essentially real time, and that an LBA can simulate an BCA, on an input of length n, in just n transitions of the LBA per BCA transition.
3 citations
Journal Article•
1 citations
TL;DR: A model of many goaloriented stochastic automata, where each automaton adapts its structure in the process of achieving its own goal to simulate a rather important class of problems of collective behavior in large systems.
1 citations
TL;DR: An algorithm is presented which permits any arbitrary subset of the cells of a content addressable tresselated automaton (CATA) to communicate with any other arbitrary subset.
Abstract: An algorithm is presented which permits any arbitrary subset of the cells of a content addressable tresselated automaton (CATA) to communicate with any other arbitrary subset.
1 citations
TL;DR: Theructure of an abelian automaton is studied in connection with the notion of the stage and the transition structure of an automaton introduced in [6].