Free Access
RAIRO. Inform. théor.
Volume 19, Number 2, 1985
Page(s) 107 - 123
Published online 01 February 2017
  1. 1. Y. M. BARZDIN, Complexity of Recognition of Symmetry in Turing Machines, Problemy Kibernetiki, vol. 15, 1965. [Google Scholar]
  2. 2. S. N. COLE, Real-time Computation by n-Dimensional Iterative Arrays of Finite-state Machines, I.E.E.E. Trans. on Computers, vol. C18, avril 1979, p. 349-365. [MR: 250518] [Zbl: 0172.20804] [Google Scholar]
  3. 3. K. CULIK II, J. GRUSKA et A. SALOMAA, On a Family of L. Languages Resulting from Systolic Tree Automata, Research Report CS-81-36, University of Waterloo. [Zbl: 0549.68081] [Google Scholar]
  4. 4. K. CULIK II, J. GRUSKA et A. SALOMAA, Systolic Treillis Automata for (VLSI), Research Report CS-81-36, University of Waterloo. [Zbl: 0493.68054] [Google Scholar]
  5. 5. M. J. FOSTER and H. T. KUNG, Recognize Regular Langages with Programmable Building-blocks, in the Proceedings of the VLSI, 1981, Conference, Edinburgh. [Google Scholar]
  6. 6. E. HOROWITZ A. ZORA, Divide-and-conquer for Parallel Processing, I.E.E.E. Trans. on Computers, vol.C32, (6), juin 1983. [Zbl: 0513.68029] [Google Scholar]
  7. 7. A. V. KULKARNI et D. W. L. YEN, Systolic Processing and an Implementation for Signal and Image Processing, I.E.E.E. Trans, on Computers, vol. C31, octobre 1982, p. 1000-1009. [Google Scholar]
  8. 8. H. T. KUNG, Why Systolic Architectures, I.E.E.E. Computer, vol. 15, n° 1, janvier 1982, p. 37-46. [Google Scholar]
  9. 9. H. T. KUNG et P. L. LEHMAN, Systolic V.L.S.J. Arrays for Relational Database Operations, Proceedings of the 1980 A.C.M./SIGMOD International Conference on Management of data, Los Angeles, U.S.A. [Google Scholar]
  10. 10. H. T. KUNG et C. E. LEISERSON, Systolic Arrays for (VLSI), in the Proceedings of the Symposium on Sparse Matrix Computations and their Applications, Knox- ville, 1978. [MR: 566379] [Zbl: 0404.68037] [Google Scholar]
  11. 11. C. E. LEISERSON et J. D. SAXE, Optimizing Synchronous Systems, 22-th Annual Symposium on Foundations of Computer Science, I.E.E.E., octobre 1981, p. 23-36. [Google Scholar]
  12. 12. Y. ROBERT et M. TCHUENTE, Designing Efficient Systolic Algorithms, Rapport de Recherche 393, Lab. I.M.A.G., Grenoble, septembre 1983. [Google Scholar]
  13. 13. A. R. SMITH III, Cellular Automata theory, Technical Report 2, Stanford Electronics Laboratories, décembre 1969. [Google Scholar]
  14. 14. M. STEINBY, Systolic Tree and Systolic Langage Recognition by Tree Automata, Theoretical Computer Science, vol. 22, 1983, p. 219-232. [MR: 693057] [Zbl: 0501.68046] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.