Iterative arrays with a wee bit alternation

  • Thomas Buchholz
  • Andreas Klein
  • Martin Kutrib
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1684)


An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fetches the input serially symbol by symbol. We are investigating iterative arrays with an alternating communication cell. All the other automata are deterministic. The number of alternating state transitions is regarded as a limited resource which depends on the length of the input.

We center our attention to real-time computations and compare alternating IAs with nondeterministic IAs. By proving that the language families of the latter are not closed under complement for sublogarithmic limits it is shown that alternation is strictly more powerful than nondeterminism. Moreover, for these limits there exist infinite hierarchies of properly included alternating language families. It is shown that these families are closed under boolean operations.


Turing Machine Existential State Communication Cell Computation Tree Closure Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Beyer, W. T. Recognition of topological invariants by iterative arrays. Technical Report TR-66, MIT, Cambridge, Proj. MAC, 1969.Google Scholar
  2. [2]
    Buchholz, Th. and Kutrib, M. Some relations between massively parallel arrays. Parallel Comput. 23 (1997), 1643–1662.CrossRefMathSciNetGoogle Scholar
  3. [3]
    Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with a wee bit alternation. IFIG Report 9905, Institute of Informatics, University of Giessen, 1999.Google Scholar
  4. [4]
    Buchholz, Th., Klein, A., and Kutrib, M. Iterative arrays with limited nondeterministic communication cell. IFIG Report 9901, Institute of Informatics, University of Giessen, 1999.Google Scholar
  5. [5]
    Chang, J. H., Ibarra, O. H., and Palis, M. A. Parallel parsing on a one-way array of finite-state machines. IEEE Trans. Comput. C-36 (1987), 64–75.CrossRefGoogle Scholar
  6. [6]
    Cole, S. N. Real-time computation by n-dimensional iterative arrays of finite-state machines. IEEE Trans. Comput. C-18 (1969), 349–365.CrossRefMathSciNetGoogle Scholar
  7. [7]
    Čulik II, K. and Yu, S. Iterative tree automata. Theoret. Comput. Sci. 32 (1984), 227–247.CrossRefMathSciNetzbMATHGoogle Scholar
  8. [8]
    Fischer, P. C. Generation of primes by a one-dimensional real-time iterative array. J. Assoc. Comput. Mach. 12 (1965), 388–394.zbMATHMathSciNetGoogle Scholar
  9. [9]
    Ibarra, O. H. and Jiang, T. On one-way cellular arrays. SIAM J. Comput. 16 (1987), 1135–1154.zbMATHCrossRefMathSciNetGoogle Scholar
  10. [10]
    Ibarra, O. H. and Palis, M. A. Some results concerning linear iterative (systolic) arrays. J. Parallel and Distributed Comput. 2 (1985), 182–218.CrossRefGoogle Scholar
  11. [11]
    Ibarra, O. H. and Palis, M. A. Two-dimensional iterative arrays: Characterizations and applications. Theoret. Comput. Sci. 57 (1988), 47–86.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    Seiferas, J. I. Iterative arrays with direct central control. Acta Inf. 8 (1977), 177–192.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    Seiferas, J. I. Linear-time computation by nondeterministic multidimensional iterative arrays. SIAM J. Comput. 6 (1977), 487–504.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Smith III, A. R. Real-time language recognition by one-dimensional cellular automata. J. Comput. System Sci. 6 (1972), 233–253.zbMATHMathSciNetGoogle Scholar
  15. [15]
    Terrier, V. On real time one-way cellular array. Theoret. Comput. Sci. 141 (1995), 331–335.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Thomas Buchholz
    • 1
  • Andreas Klein
    • 1
  • Martin Kutrib
    • 1
  1. 1.Institute of InformaticsUniversity of GiessenGiessenGermany

Personalised recommendations