Topic
Continuous automaton
About: Continuous automaton is a research topic. Over the lifetime, 947 publications have been published within this topic receiving 17417 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: The concept of a rough finite-state semi-automaton, in which the result of any transition is a rough set of states, is formulated and then extended to that of a rougher automaton by adding the set of accepting states.
Abstract: The concept of a rough finite-state semi-automaton, in which the result of any transition is a rough set of states, is formulated and then extended to that of a rough finite-state automaton by adding the set of accepting states. The behavior of such an automaton is defined and turns out to be a rough set of input words.
16 citations
Journal Article•
TL;DR: This paper deals with a particular two-dimensional totalistic CA rule, the parity rule, acting on cells with two possible state values, the triangular tessellation starting from an active cell with its three neighbors also active.
Abstract: Cellular automata (CAs) are discrete, spatially explicit extended dynamic systems. A CA system is composed of adjacent cells or sites arranged as a regular lattice, which evolves in discrete time steps. Each cell is characterized by an internal state whose value belongs to a finite set. The updating of these states is made simultaneously according to a common local transition rule involving only the neighborhood of each cell. Thus, if Σ(T) i is taken to denote the value of cell i at time step T, the site values evolve by iteration of the mapping: Σ(T 1) i Φ(Σ (T) j i), where Φ is an arbitrary function which specifies the CA rule operating on the neighborhood of the cell i [1]. This paper deals with a particular two-dimensional totalistic CA rule, the parity rule: Σ(T 1) i j i Σ (T) j mod 2, acting on cells with two possible state values (0 and 1). Despite its formal simplicity, the parity rule exhibits complex behavior [2]. We restrict ourselves here to the triangular tessellation, again a simple scenario that allows for complex behavior [3, 4]. Figure 1 shows an example of the parity rule operating on the triangular tessellation starting from an active cell with its three neighbors also active. This is the initial configuration used throughout this paper.
16 citations
17 Jul 2006
TL;DR: This new automaton, called IJA, is an improvement of the Krinsky FSSA and not only ε-optimal and expedient, but also converges to the optimal action faster than the old one.
Abstract: In this paper, we present a new fixed structure learning automaton (FSSA), called IJA, and study its steady state behavior in stationary environments. The proposed automaton characterizes by star shaped transition diagram and each branch of the star contains N states associated with a particular action. This new automaton is an improvement of the Krinsky FSSA and not only e-optimality and expedient, but also converges to the optimal action faster than the old one.
16 citations
01 Oct 2013
TL;DR: In this article, the authors propose a new automaton called simultaneous finite automaton (SFA) for efficient parallel computation of an automaton, which involves the simulation of transitions and achieves over 10 times speedup on an environment with dual hexa-core CPUs.
Abstract: Automata play important roles in wide area of computing and the growth of multicores calls for their efficient parallel implementation. Though it is known in theory that we can perform the computation of a finite automaton in parallel by simulating transitions, its implementation has a large overhead due to the simulation. In this paper we propose a new automaton called simultaneous finite automaton (SFA) for efficient parallel computation of an automaton. The key idea is to extend an automaton so that it involves the simulation of transitions. Since an SFA itself has a good property of parallelism, we can develop easily a parallel implementation without overheads. We have implemented a regular expression matcher based on SFA, and it has achieved over 10-times speedups on an environment with dual hexa-core CPUs in a typical case.
16 citations
TL;DR: In this paper, a simple dynamic evolving automaton is proposed to reproduce the statistical mechanical properties of earthquakes, including the effects due to transient loads such as those imposed by elastic waves, with an efficiency superior to that of the most complicated automata.
Abstract: SUMMARY The physics of fractures, which forms the basis of seismic faulting, is not very amenable to simple deterministic differential equations. For this reason a different approach, aimed at reproducing the statistical mechanical properties of earthquakes, has attracted progressively increasing interest. A variety of models have been presented but there seems to be little that can be done to ascertain the merits and defects of each. We set the clock back and attempt to derive a dynamically evolving automaton that is as simple as possible and that incorporates all the basic ingredients and includes strain diffusion, a process often disregarded in simple models in spite of its crucial importance. Our automaton is based on a homogeneous grid of cells and its rupturing is controlled by a generalized local threshold. The automaton also considers local dissipation of energy and time-dependent strain applications. This simple model is capable of reproducing earthquake dynamics, including the effects due to transient loads such as those imposed by elastic waves, with an efficiency superior to that of the most complicated automata and with less stringent assumptions.
16 citations