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: In this article, a quadratic algorithm for computing the equation K-automaton of a regular K-expression as defined by Lombardy and Sakarovitch is described. But this algorithm is based on an extension to regular Kexpressions of the notion of c-continuation that was introduced to compute the equation automaton as a quotient of its position automaton.
Abstract: The aim of this paper is to describe a quadratic algorithm for computing the equation K-automaton of a regular K-expression as defined by Lombardy and Sakarovitch Our construction is based on an extension to regular K-expressions of the notion of c-continuation that we introduced to compute the equation automaton of a regular expression as a quotient of its position automaton
22 citations
10 Jul 2006
TL;DR: This paper improves the construction of deterministic asynchronous automata from finite state automaton, and improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the sizes of the sequential automaton and the number of processes.
Abstract: The well-known algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka's algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton)
22 citations
Journal Article•
TL;DR: In this article, the authors improved the construction of deterministic asynchronous automata from finite state automata and gave an asynchronous automaton that is doubly exponential in both the number of processes and the size of the automaton.
Abstract: The well-known algorithm of Zielonka describes how to transform automatically a sequential automaton into a deterministic asynchronous trace automaton. In this paper, we improve the construction of deterministic asynchronous automata from finite state automaton. Our construction improves the well-known construction in that the size of the asynchronous automaton is simply exponential in both the size of the sequential automaton and the number of processes. In contrast, Zielonka's algorithm gives an asynchronous automaton that is doubly exponential in the number of processes (and simply exponential in the size of the automaton).
22 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
Journal Article•
TL;DR: The Cellular Automaton (CA) model for Solar flares of Lu and Hamilton (1991) can be understood as the solution to a particular partial differential equation (PDE), which describes diffusion in a localized region in space if a cer- tain instability threshold is met, together with a slowly acting source term.
Abstract: We show that the Cellular Automaton (CA) model for Solar flares of Lu and Hamilton (1991) can be understood as the solution to a particular partial differential equation (PDE), which describes diffusion in a localized region in space if a cer- tain instability threshold is met, together with a slowly acting source term. This equation is then compared to the induction equation of MHD, the equation which governs the energy re- lease process in solar flares. The similarities and differences are discussed. We make some suggestions how improved Cellular Automaton models might be constructed on the basis of MHD, and how physical units can be introduced in the existing respec- tive Cellular Automaton models. The introduced formalism of recovering equations from Cellular Automata models is rather general and can be applied to other situations as well. subsystems. The essence of the CA approach to such systems is to assume that the global dynamics, if described statistically, are not sensitive to the details of the elementary processes, the system has the property that most local information gets lost if viewed globally. The 'classical' approach to complex systems, on the other hand, is analytical: from a precise description of the elementary processes — in the optimum case involving the fundamental laws of physics, i.e. differential equations — one tries to understand a process globally. Both approaches have drawbacks and advantages. The CA approach does not explain what happens locally or over short time intervals, but it allows to understand the statistics of the global behaviour. The analyt- ical approach may reveal insights into the local processes, but coupling this understanding to a global description is practically not feasible, mainly due to the large number of (in astrophysics even unobserved) boundary conditions. In this sense, the two ap- proaches can be considered as complementary, and a description
21 citations