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: 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.
Journal Article•
TL;DR: It is shown that under this metric, for cert ain regular langu ages, the set of rules under which the language is invariant contains no interior, and its compleme nt containsno interior.
Abstract: Procedures are given for det ermining regul ar language invariance under on e-dimensi on al cellular auto maton rul es. A met ric is defined for t he space of all one-dimensional cellular automato n rules over a given alphabet :E . It is shown that under this metric, for cert ain regular langu ages , the set of rules under which the language is invariant contains no interior, and its compleme nt contains no interior. Ch ar act eristics of surjective rules (rules under which t he regular langu age :E* is invariant) ar e also explored. Examples ar e given of a sequence of rul es for which the limit lan gu age of the limit rul e is not invari ant under any rul e in the sequence. Numerical experime nts indicate that t hese rules do indeed display discont inuous behavior.
TL;DR: Given the initial state of an automaton and a suffix portion of the input sequence to the automaton, the possibility of determining the final state of the Automaton is investigated.
Abstract: Given the initial state of an automaton and a suffix portion of the input sequence to the automaton, the possibility of determining the final state of the automaton is investigated
01 May 2006
TL;DR: The idea is to theoretically trace the output of the circuit implementing the next state functions of the Automaton, determine the time frames when these outputs are logically correct and use those specific moments of time to provoke the automaton's evolution towards the next correct state.
Abstract: The present paper considers the problem of digital hazards that are present in combinatorial logic structures. My work is focused not on eliminating these hazards but on how to avoid and eventually use this unwanted feature when we are designing a digital automaton. The idea is to theoretically trace the output of the circuit implementing the next state functions of the automaton, determine the time frames when these outputs are logically correct and use those specific moments of time to provoke the automaton's evolution towards the next correct state (according to the automaton's states transitions graph). By doing so we shall drastically improve the working speed of the automaton we design.
23 Dec 2022
TL;DR: In this paper , a fuzzy cellular automaton obtained from an elementary cellular automata of rule number 38 is investigated, and its asymptotic solutions are classified into two types.
Abstract: Fuzzy cellular automaton is a dynamical system with a continuous state value embedding a cellular automaton with a discrete state value. We investigate a fuzzy cellular automaton obtained from an elementary cellular automaton of rule number 38. Its asymptotic solutions are classified into two types. One is a solution where stable propagating waves exist, and the other is a static uniform solution of constant value.