SUBLINEARLY SPACE BOUNDED ITERATIVE ARRAYS
Andreas Malcher, Carlo Mereghetti, Beatrice Palano · International Journal of Foundations of Computer Science · 2010
Iterative arrays (IAs) are a parallel computational model with a sequential processing of the input. They are one-dimensional arrays of interacting identical deterministic finite automata. In this paper, realtime-IAs with sublinear space bounds are used to recognize formal languages. The existence of an infinite proper hierarchy of space complexity classes between logarithmic and linear space bounds is proved. Some decidability questions on logarithmically space bounded realtime-IAs are investigated, and an optimal logarithmic space lower bound for non-regular language recognition on realtime-IAs is shown. Finally, some non-recursive trade-offs between space bounded realtime-IAs are emphasized.