Showing papers on "Continuous automaton published in 1983"
TL;DR: Criteria for surjectivity and injectivity of the global transition function of such a cellular automaton are presented and the question of reappearance of patterns for such cellular automata is also dealt with.
106 citations
TL;DR: It is suggested that the weak metaphor of a genetic program, classically used to account for the role of DNA in specific genetic determinations, is replaced by that of inputs to biochemical probabilistic automata.
15 citations
TL;DR: It is shown that there exists a one-input automaton whose transformation semigroup has its order greater than any polynomial function of the number of states and that the index and the period of the transformation semitecture can be determined in time proportional to thenumber of states.
6 citations
TL;DR: It is shown that, once the number of neighbors connected to each cell is fixed, there exist periodic sequences in m letters such that the cellular automaton is not capable of transforming them in one step into periodic sequence in $(m - 1)$ letters, preserving at the same time their primitive periods.
Abstract: Consider a cellular automaton in one dimension, having m letters as the states of the constituent finite state automata, called cells. It is shown that, once the number of neighbors connected to each cell is fixed, there exist periodic sequences in m letters such that the cellular automaton is not capable of transforming them in one step into periodic sequences in $(m - 1)$ letters, preserving at the same time their primitive periods, regardless of the choices of transformation functions. Our proof is by the construction of sequences which prevent any given cellular automaton from performing the task.
1 citations
TL;DR: A new type of automaton on a two-dimensional tape is introduced, which decides acceptance or rejection of an input tape x by first scanning the tape x from various sides with parallel/sequential array readers, and by then scanning the pair of the halting state configurations generated by these array readers with a multitape finite automaton.