Skip to main content
Article thumbnail
Location of Repository

Sublinearly space bounded iterative arrays

By Andreas Malcher, Carlo Mereghetti and Beatrice Palano

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 note, realtime-lAs with sublinear space bounds are used to accept formal languages. The existence of a proper hierarchy of space complexity classes between logarithmic anel linear space bounds is proved. Furthermore, an optimal spacc lower bound for non-regular language recognition is shown. Key words: Iterative arrays, cellular automata, space bounded computations, decidability questions, formal languages, theory of computatio

Topics: ddc:004
Year: 2007
OAI identifier: oai:publikationen.ub.uni-frankfurt.de:7189

Suggested articles

Citations

  1. (1994). A.: Turing machines with sublogarithrnic space.
  2. (2001). Automata arrays anel context-free languages.
  3. (2006). Fast iterative arrays with restricted intercell communication: constructions and elecidability.
  4. (1979). Introduction to Automata Theory, Languages, anel Computation.
  5. (2004). On the descriptional complexity of iterative arrays.
  6. (1965). P.M.: Hierarchies of memory limited computations. In:
  7. (1969). Real-time computatioll by n-dimensional iterative arrays of finite-state machines.
  8. (2003). Real-time generation of primes by a I-bit communication cellular automaton.
  9. (2007). Real-time reversible iterative arrays. In:
  10. (1997). Some relations between lll<ussively parallel arrays.
  11. (2007). The descriptional power of suhlogarithmic resource bounded Turing machines. In:

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.