A Time Hierarchy for Bounded One-Way Cellular Automata

Authors:
Andreas Klein;Martin Kutrib
Affiliations:
-;-
Venue:
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Year:
2001

Citing 7
Cited 1

On real-time cellular automata and trellis automata

Acta Informatica
On real time one-way cellular array

Theoretical Computer Science
Language not recognizable in real time by one-way cellular automata

Theoretical Computer Science
Signals in one-dimensional cellular automata

Theoretical Computer Science - Special issue: cellular automata
Generation of Primes by a One-Dimensional Real-Time Iterative Array

Journal of the ACM (JACM)
On interacting automata with limited nondeterminism

Fundamenta Informaticae - Special issue on cellular automata
One Guess One-Way Cellular Arrays

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science

Signals for Cellular Automata in Dimension 2 or Higher

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from real-time to exponential-time is between real-time and linear-time! We show the surprising result that there exists an infinite hierarchy of properly included OCA-language families in that range. A generalization of a method in [10] is shown that provides a toolf or proving that languages are not acceptable by OCAs with small time bounds. By such a language and a translation result the hierarchies are established.