@article{ITA_1985__19_2_107_0, author = {Robert, Yves and Tchuente, Maurice}, title = {R\'eseaux systoliques pour des probl\`emes de mots}, journal = {RAIRO. Informatique th\'eorique}, pages = {107--123}, publisher = {EDP-Sciences}, volume = {19}, number = {2}, year = {1985}, mrnumber = {803993}, zbl = {0569.68063}, language = {fr}, url = {http://www.numdam.org/item/ITA_1985__19_2_107_0/} }
Robert, Yves; Tchuente, Maurice. Réseaux systoliques pour des problèmes de mots. RAIRO. Informatique théorique, Tome 19 (1985) no. 2, pp. 107-123. http://www.numdam.org/item/ITA_1985__19_2_107_0/
1. Complexity of Recognition of Symmetry in Turing Machines, Problemy Kibernetiki, vol. 15, 1965.
,2. 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 | Zbl
,3. On a Family of L. Languages Resulting from Systolic Tree Automata, Research Report CS-81-36, University of Waterloo.
, et ,4. Systolic Treillis Automata for (VLSI), Research Report CS-81-36, University of Waterloo.
, et ,5. Recognize Regular Langages with Programmable Building-blocks, in the Proceedings of the VLSI, 1981, Conference, Edinburgh.
and ,6. Divide-and-conquer for Parallel Processing, I.E.E.E. Trans. on Computers, vol.C32, (6), juin 1983. | Zbl
,7. Systolic Processing and an Implementation for Signal and Image Processing, I.E.E.E. Trans, on Computers, vol. C31, octobre 1982, p. 1000-1009.
et ,8. Why Systolic Architectures, I.E.E.E. Computer, vol. 15, n° 1, janvier 1982, p. 37-46.
,9. 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.
et ,10. Systolic Arrays for (VLSI), in the Proceedings of the Symposium on Sparse Matrix Computations and their Applications, Knox- ville, 1978. | MR | Zbl
et ,11. Optimizing Synchronous Systems, 22-th Annual Symposium on Foundations of Computer Science, I.E.E.E., octobre 1981, p. 23-36.
et ,12. Designing Efficient Systolic Algorithms, Rapport de Recherche 393, Lab. I.M.A.G., Grenoble, septembre 1983.
et ,13. Cellular Automata theory, Technical Report 2, Stanford Electronics Laboratories, décembre 1969.
,14. Systolic Tree and Systolic Langage Recognition by Tree Automata, Theoretical Computer Science, vol. 22, 1983, p. 219-232. | MR | Zbl
,