Low complexity classes of multidimensional cellular automata

Authors:
Véronique Terrier
Affiliations:
GREYC, Université de Caen, Caen, France
Venue:
Theoretical Computer Science
Year:
2006

Citing 14
Cited 0

On real-time cellular automata and trellis automata

Acta Informatica
Parallel parsing on a one-way array of finite-state machines

IEEE Transactions on Computers
On one-way cellular arrays

SIAM Journal on Computing
On the power of one-way communication

Journal of the ACM (JACM)
Relating the power of cellular arrays to their closure properties

Theoretical Computer Science
Two-dimensional iterative arrays: characterizations and applications

Theoretical Computer Science - International Symposium on Mathematical Foundations of Computer Science, Bratisl
Alternating multihead finite automata

Theoretical Computer Science
Variations of the firing squad problem and applications

Information Processing Letters
Efficient simulations of simple models of parallel computation by time-bounded ATMs and space-bounded TMs

Theoretical Computer Science
On real time one-way cellular array

Theoretical Computer Science
Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
A universal interconnection pattern for parallel computers

Journal of the ACM (JACM)
Alternation in Simple Devices

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Characterization of real time iterative array by alternating device

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this paper, multidimensional cellular automaton are considered. We investigate the hierarchy designed by the low complexity classes when the dimensionality is increased. Whether this hierarchy is strict, is an open problem. However, we compare different variants and study their closure properties. We present also a correspondence between a main variant of multidimensional real-time cellular automata and one-way multihead alternating finite automata.