One-way bounded cellular automata
Reads0
Chats0
TLDR
Real-time acceptors are presented for many of the languages that have been shown to be accepted by conventional two-way acceptors, including several classes of context-free languages.Abstract:
This paper studies a restriction of one-dimensional bounded cellular automata in which information is allowed to move only in one direction. Real-time acceptors are presented for many of the languages that have been shown to be accepted by conventional two-way acceptors, including several classes of context-free languages.read more
Citations
More filters
Journal ArticleDOI
Theory of cellular automata: a survey
TL;DR: The main goal is to provide a tutorial of CA theory to researchers in other branches of natural computing, to give a compact collection of known results with references to their proofs, and to suggest some open problems.
Journal ArticleDOI
A brief history of cellular automata
TL;DR: A history of cellular automata from their beginnings with von Neumann to the present day is traced, mainly on topics closer to computer science and mathematics rather than physics, biology or other applications.
Journal ArticleDOI
On real-time cellular automata and trellis automata
Christian Choffrut,Karel Culik +1 more
TL;DR: It is shown that f(n)-time one-way cellular automata are equivalent to f( n)-time trellis automata, the real-timeOne-way Cellular automata languages are closed under reversal, the 2n- time one- way cellular Automata are equivalents to real- time cellular automATA and the latter are strictly more powerful than the real -time one -way cellularAutomata.
Journal ArticleDOI
Computation theoretic aspects of cellular automata
K. Culik,L. P. Hurd,S. Yu +2 more
TL;DR: This paper surveys results largely motivated by an attempt to answer questions posed by the approach to cellular automata by means of techniques from the former.
Journal ArticleDOI
A survey of two-dimensional automata theory
Katsushi Inoue,Itsuo Takanami +1 more
TL;DR: The main purpose of this paper is to survey several properties of alternating, nondeterministic, and deterministic two-dimensional Turing machines (including two- dimension finite automata and marker automata), and to briefly survey cellular types of two- dimensional automata.
References
More filters
Journal ArticleDOI
On the computational complexity of algorithms
Proceedings ArticleDOI
Hierarchies of memory limited computations
TL;DR: The computational complexity of binary sequences as measured by the rapidity of their generation by multitape Turing machines is investigated and a "translational" method which escapes some of the limitations of earlier approaches leads to a refinement of the established hierarchy.
Proceedings ArticleDOI
Automata on a 2-dimensional tape
Manuel Blum,Carl Hewitt +1 more
TL;DR: This paper merely begins to describe the action of automata in higher dimensions, and the goal now is to generalize the theory presented and make it applicable to a wide variety of pattern-recognizing machines.
Journal ArticleDOI
Real-time language recognition by one-dimensional cellular automata
TL;DR: Pattern recognition by parallel devices is investigated by studying the formal language recognition capabilities of one-dimensional cellular automata, finding that nondeterministic bounded cellular Automata can recognize the context-free languages in real time.
Journal ArticleDOI
Generation of Primes by a One-Dimensional Real-Time Iterative Array
TL;DR: A construction is given of a one-dimensional iterative of finite-state sequential machines, which can generate in real time the binary sequence representing the set of prime numbers.