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 ...

Abstract. Space-bounded one-way cellular language acceptors (OCA) are investigated. The only inclusion known to be strict in their time hierarchy from ...

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 ...

This paper studies a restriction of one-dimensional bounded cellular automata in which information is allowed to move only in one direction. Real-time ...

Ü Let Lr1 be the witness language of the time hierarchy. Ü Define L$,r1 such that exactly one $ is inserted after each of the rightmost r1(|w|) symbols of w ...

A Time Hierarchy for Bounded One-Way Cellular Automata. A Time Hierarchy for Bounded One-Way Cellular Automata. Dateien. IfigReport0101.pdf (226.45 KB) ...

For fixed, periodic, and twisted boundary conditions, the level of the finite time set in the Chomsky hierarchy cannot increase in the time evolution, which in.

Cellular automata are one-dimensional arrays of interconnected interacting finite automata, also called cells. Here, we investigate one of the weakest class ...

Deterministic one-way time-bounded multi-counter automata are studied with respect to their ability to perform reversible computations, which means that the ...

This paper studies a restriction of one-dimensional bounded cellular automata in which information is allowed to move only in one direction. Real-time aeceptors ...