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 accept 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. Furthermore, an optimal space lower bound for non-regular language recognition on realtime-IAs is shown.
Recent results on iterative arrays with small space bounds / A. Malcher, C. Mereghetti, B. Palano - In: Automata-2008 : theory and applications of cellular automata / [a cura di] A. Adamatzky, R. Alonso-Sanz, A. Lawniczak, G.J. Martinez, K. Morita, T. Worsch. - [s.l] : Luniver Press, 2008. - ISBN 9781905986163. - pp. 222-227 (( convegno AUTOMATA tenutosi a Bristol nel 2008.
Recent results on iterative arrays with small space bounds
C. Mereghetti;B. Palano
2008
Abstract
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 accept 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. Furthermore, an optimal space lower bound for non-regular language recognition on realtime-IAs is shown.File | Dimensione | Formato | |
---|---|---|---|
aut08.pdf
accesso riservato
Tipologia:
Publisher's version/PDF
Dimensione
110.14 kB
Formato
Adobe PDF
|
110.14 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.