On Some Open Problems in the Theory of Cellular Automata

Authors:
S. R. Kosaraju
Affiliations:
Department of Electrical Engineering, The Johns Hopkins University
Venue:
IEEE Transactions on Computers
Year:
1974

Citing 7
Cited 0

RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS

RECOGNITION OF TOPOLOGICAL INVARIANTS BY ITERATIVE ARRAYS
Computations on iterative automata

Computations on iterative automata
Formal languages and their relation to automata

Formal languages and their relation to automata
Theory of Self-Reproducing Automata

Theory of Self-Reproducing Automata
Machine Complexity Versus Interconnection Complexity in Iterative Arrays

IEEE Transactions on Computers
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines

IEEE Transactions on Computers
Two-dimensional formal languages and pattern recognition by cellular automata

SWAT '71 Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)

Quantified Score

Hi-index	14.98

Visualization

Abstract

Some open problems in the theory of cellular automata are considered: the tradeoff between machine complexity and interconnection complexity, linear time pattern recognition and transformation problems, and the noncomputability of the constant of linearity of linear time problems.