Some relations between massively parallel arrays

Parallel Computing

Volumn 23, Issue 11, 1997, Pages 1643-1662

  Buchholz, Thomas ^a   Kutrib, Martin ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

Complexity; Computability; Constructibility; Parallel automata

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; FINITE AUTOMATA;

TIME COMPUTE FUNCTIONS; TIME CONSTRUCT FUNCTIONS;

PARALLEL PROCESSING SYSTEMS;

EID: 0031272348     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0167-8191(97)00075-6     Document Type: Article

References (15)

1. S. Amoroso, E. Lieblein, H. Yamada, A unifying framework for the theory of iterative arrays of machines, 1st Ann. ACM Symposium on Theory of Computing (STOC '69), Marina del Ray, CA, 1969, pp. 259-269.
2. Th. Buchholz, M. Kutrib, On time computability of functions in one-way cellular automata, To appear in: Acta Informatica (1997).
3. Th. Buchholz, M. Kutrib, On the power of one-way bounded cellular time computers, in: Developments in Language Theory 1997, Thessaloniki, Greece; and Report 9604, Institut für Informatik, Universität Gießen, Gießen, 1996.
4. E.F. Codd, Cellular Automata, Academic Press, New York, 1968.
5. P.C. Fischer, Generation of primes by a one-dimensional real-time iterative array, Journal of the ACM 12 (1965) 388-394.
6. F. Hennie, Iterative Arrays of Logical Circuits, MIT Press, Cambridge, MA, 1961.
7. M. Kutrib, A note on cellular real-time recognizability of languages definable by a family of functions, Unpublished manuscript, 1995.
8. M. Kutrib, Pushdown cellular automata, To appear in: Theoretical Computer Science (1997).
9. M. Kutrib, J. Richstein, Real-time one-way pushdown cellular automata languages, in: J. Dassow, G. Rozenberg, A. Salomaa (Eds.), Developments in Language Theory II - At the Crossroads of Mathematics, Computer Science and Biology, World Scientific Publishing, Singapore, 1996, pp. 420-429.
10. M. Kutrib, Th. Worsch, Investigation of different input modes for cellular automata, Parcella '94, Akademie Verlag, Berlin 1994, pp. 141-150.
11. J. Mazoyer, A six-state minimal time solution to the firing squad synchronization problem, Theoretical Computer Science 50 (1987) 183-238.
12. J. Mazoyer, V. Terrier, Signals in one dimensional cellular automata, Research report RR 94-50, Ecole Normale Supérieure de Lyon, Lyon, 1994.
13. R. Vollmar, Algorithmen in Zellularautomaten, Teubner, Stuttgart, 1979.
14. R. Vollmar, Some remarks on pipeline processing by cellular automata, Computers and Artificial Intelligence 6 (1987) 263-278.
15. A. Waksman, An optimum solution to the firing squad synchronization problem, Information and Control 9 (1966) 66-78.