Showing papers on "Continuous automaton published in 1994"
TL;DR: A new procedure for inferring the structure of a finitestate automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments, based on the notion of equivalence between testa.
Abstract: We present new procedures for inferring the structure of a finite-state automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments.Our procedures use a new representation for finite automata, based on the notion of equivalence between tests. We call the number of such equivalence classes the diversity of the automaton; the diversity may be as small as the logarithm of the number of states of the automaton. For the special class of permutation automata, we describe an inference procedure that runs in time polynomial in the diversity and log(1/d), where d is a given upper bound on the probability that our procedure returns an incorrect result. (Since our procedure uses randomization to perform experiments, there is a certain controllable chance that it will return an erroneous result.) We also discuss techniques for handling more general automata.We present evidence for the practical efficiency of our approach. For example, our procedure is able to infer the structure of an automaton based on Rubik's Cube (which has approximately 1019 states) in about 2 minutes on a DEC MicroVax. This automaton is many orders of magnitude larger than possible with previous techniques, which would require time proportional at least to the number of global states. (Note that in this example, only a small fraction (10-14) of the global states were even visited.)Finally, we present a new procedure for inferring automata of a special type in which the global state is composed of a vector of binary local state variables, all of which are observable (or visible) to the experimenter. Our inference procedure runs provably in time polynomial in the size of this vector (which happens to be the diversity of the automaton), even though the global state space may be exponentially larger. The procedure plans and executes experiments on the unknown automaton; we show that the number of input symbols given to the automaton during this process is (to within a constant factor) the best possible.
113 citations
13 Sep 1994
TL;DR: A cellular automaton based on adaptive function of living systems gives each cell local rules such as 'death', 'birth', and 'division' like an organism and generates a clear framed structure for a mechanical condition.
Abstract: This paper describes a cellular automaton based on adaptive function of living systems. We simulated the behavior on a computer giving each cell local rules such as 'death', 'birth', and 'division' like an organism. The computational results showed that the model generates a clear framed structure for a mechanical condition. We also reported on diverse topological structures inhered in the system.
52 citations
TL;DR: A quasi-linear time universal cellular automaton is described, which is capable of simulating arbitrary one-dimensional cellular automata, even two-way, and it is proved that cellular Automata form an acceptable programming system for parallel computation, thus providing an S-m-n theorem for Cellular automata.
45 citations
TL;DR: It is decidable in deterministic double exponential time whether two given finite-valued distance automata are equivalent, i.e., every input word has the same distance in both machines.
37 citations
TL;DR: If an array language is generated by an RPCA, it can be parsed in parallel by a deterministic inverse PCA without backtracking, and the characteristic of PCAAG is that a “reversible” version is easily defined.
Abstract: We propose a new system of generating array languages in parallel, based on a partitioned cellular automaton (PCA), a kind of cellular automaton. This system is called a PCA array generator (PCAAG). The characteristic of PCAAG is that a “reversible” version is easily defined. A reversible PCA (RPCA) is a backward deterministic PCA, and we can construct a deterministic “inverse” PCA that undoes the operations of the RPCA. Thus if an array language is generated by an RPCA, it can be parsed in parallel by a deterministic inverse PCA without backtracking. We also define two subclasses of PCAAG, and give examples of them that generate geometrical figures.
26 citations
TL;DR: In this paper, the boundaries between the three phases of the Domany-Kinzel probabilistic cellular automaton are determined with high accuracy via the gradient method and the difficulties the extrapolation to the thermodynamic limit are circumvented and the critical exponents also presented.
Abstract: The boundaries between the three phases of the Domany-Kinzel probabilistic cellular automaton are determined with high accuracy via the gradient method. The difficulties the extrapolation to the thermodynamic limit are circumvented and the critical exponents are also presented.
22 citations
TL;DR: In this article, the authors present numerical and analytical results for a special kind of one-dimensional probabilistic cellular automaton, the so-called Domany-Kinzel automaton.
Abstract: We present numerical and analytical results for a special kind of one-dimensional probabilistic cellular automaton, the so-called Domany-Kinzel automaton. It is shown that the phase boundary separating the active and the recently found chaotic phase exhibits re-entrant behaviour. Furthermore exact results for the p2=0 line are discussed.
16 citations
TL;DR: In this article, an operational model of concurrent systems, called automata with concurrency relations, was investigated, where the event set is endowed with a collection of binary relations which indicate when two events, in a particular state of the automaton, commute.
14 citations
TL;DR: In this article, simple algebraic cellular automata and diffusion confinement are used to model quantum behavior of a relativistic particle in a 1-dimensional box, and the persistent tension between deterministic pictures and probabilistic descriptions of quantum reality is clarified for the case of a 1D quantum particle viewed as a cellular automaton surging for survival in space and time.
Abstract: Simple algebraic cellular automata and a diffusion confinement are used to model quantum behavior of a relativistic particle in a 1-D box. Comparisons and contrasts are drawn between such a quantum cellular automaton (QCA) and both orthodox and unorthodox interpretations of quantum mechanics. The persistent tension between deterministic pictures and probabilistic descriptions of quantum reality are clarified for the case of a 1-D quantum particle viewed as a cellular automaton surging for survival in space and time.
9 citations
01 Nov 1994
TL;DR: The ultimate aim is to give a new characterization of LCRFL, the class of languages accepted by a linear context-free rewriting system (LCFRS), by introducing 2-SA as a new automaton model for tree-adjoining grammars (TAG).
Abstract: In this paper, we introduce and define a new class of automata (pushdown automata with n stacks, abbreviated as n-SA). The ultimate aim is to give a new characterization of LCRFL, the class of languages accepted by a linear context-free rewriting system (LCFRS). In particular, we introduce 2-SA as a new automaton model for tree-adjoining grammars (TAG). In the simplest cases (0-SA and 1-SA), the languages that are accepted by the automata are the regular and context-free languages respectively. A more complex case is the case of a 2-SA which accepts TALs. The n-SA creates an infinite hierarchy of languages and it seems that this hierarchy corresponds to others in the class LCFRL. The 2-SA corresponds closely to the EPDA (embedded pushdown automaton, an automaton model equivalent to TAGs). Unlike the EPDA, which allows push operations “below the top stack,” an n-SA allows push and pop operations only on the top of their (multiple) stacks. So n-SA trade simpler operations against an also simpler but expanded storage structure.
9 citations
TL;DR: It is shown that 2-NOTA's and 2-AFA's are incomparable, which answers in the negative an open question in [IT89a].
01 Jan 1994
TL;DR: An on-line and decentralized path-planning algorithm for multiple automata and its deadlock-free characteristic in an infinite 2-d world is proposed and discussed.
Abstract: In this paper, we propose an on-line and decentralized path-planning algorithm for multiple automata and then discuss its deadlock-free characteristic in an infinite 2-d world. In this research, we consider many automata with a finite number in the world without any static obstacle. Each automaton with the same circular shape can move for omni-directions to arrive at the goal. An automaton basically does not see any information except its present position in an on-line manner, and therefore usually goes straight to the goal and finally stops at it. However an automaton exceptionally knows a behavior of another colliding one by its ring of tactile sensors, and in a real time way, it processes the present own and partner’s behaviors to determine its next own behavior by the common sense.
TL;DR: The adoption of cellular automata introduces a new means of spatial data modelling, in addition to those traditionally provided by GIS packages, resulting in the possibility of storing elements of dynamic knowledge in cellular maps.
TL;DR: When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation.
Abstract: We study the critical behavior of a probabilistic automata network whose local rule consists of two subrules. The first one, applied synchronously, is a probabilistic one-dimensional range-one cellular automaton rule. The second, applied sequentially, exchanges the values of a pair of sites. According to whether the two sites are first-neighbors or not, the exchange is said to be local or nonlocal. The evolution of the system depends upon two parameters, the probability p characterizing the probabilistic cellular automaton, and the degree of mixing m resulting from the exchange process. Depending upon the values of these parameters, the system exhibits a bifurcation similar to a second order phase transition characterized by a nonnegative order parameter, whose role is played by the stationary density of occupied sites. When m is very large, the correlations created by the application of the probabilistic cellular automaton rule are destroyed, and, as expected, the behavior of the system is then correctly predicted by a mean-field-type approximation. According to whether the exchange of the site values is local or nonlocal, the critical behavior is qualitatively different as m varies.
TL;DR: In this paper, a three dimensional deterministic cellular automata (rule 33) which exhibits a nontrivial quasiperiodic behavior is studied and it is shown that the way in which the neighbours are selected causes the appearance or disappearance of that behaviour.
Abstract: A three dimensional deterministic cellular automata (rule 33) which exhibits a nontrivial quasiperiodic behaviour is studied. We show that the way in which the neighbours are selected causes the appearance or disappearance of that behaviour.
Patent•
30 Sep 1994
TL;DR: In this article, a cellular automaton part is provided with cellular automata each including a plurality of cells, each cell has a growth period state derived circuit for growing a cell column and a stable period state deriving circuit for stabilizing the cell column.
Abstract: A cellular automaton part is provided with cellular automata each including a plurality of cells. Each cell is provided with a growth period state deriving circuit for growing a cell column and a stable period state deriving circuit for stabilizing the cell column. An input/output part carries out input/output in/from the cellular automata in relation to a target problem, and outputs the same also to an evaluation part. The evaluation part operates the degrees of application of the cellular automata with respect to the target problem, so that an evaluation reflecting part decides next initial states of the cellular automata and operations of the growth period and stable period state deriving circuits on the basis of evaluation values of the evaluation part.
TL;DR: In this paper, the authors define free, torsion-free and Torsion free completely on an automaton and prove some properties of them which are important for any automaton.
Abstract: In this paper we define free, torsion-free and torsion-free completely on an automaton. We prove some properties of them which are important
01 Mar 1994
TL;DR: This work studies CREP for two natural weakly predictable classes of TCA: the booleandisjunctive class and the additive one, and proves that CREP is in Co-AM, where AM is the class of problems with a constant round interactive protocol andCREP is unlikely to be N P-complete.
Abstract: Studying the computational complexity of the Configuration Reachabilty Problem (CREP) is a good way to investigate properties of a given discrete deterministic dynamical system like a Toroidal Cellular Automaton (TCA) We study CREP for two natural weakly predictable classes of TCA: the booleandisjunctive class and the additive one For the first class, we reduce CREP to a path problem on a strongly connected digraph and we show a polynomialtime algorithm for this problem Some consequences of this result on arbitrary TCA are also analysed For the second class, we show that CREP is not easier than computing the vectorial version of the Discrete Log Problem (DLP) However, we also show CREP is unlikely to be N P-complete To do this, we prove that CREP is in Co-AM[2], where AM[2] is the class of problems with a constant round interactive protocol [1, 13] CREP is unlikely to be N P-complete (unless the polynomial time hierarchy collapses), then follows by the results of [3] All such results hold even when multidimensional and/or non homogeneous TCA arise As a global consequence, we argue that the structure of the weakly predictable class resembles the N P one
15 Apr 1994
TL;DR: It is shown that slight changes in the initial state can lead to different universality classes (in the sense of Wolfram) for the final state for particular one-dimensional cellular automata.