Réseaux systoliques pour des problèmes de mots
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 2, pp. 107-123.
@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 - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {107--123},
     publisher = {EDP-Sciences},
     volume = {19},
     number = {2},
     year = {1985},
     zbl = {0569.68063},
     mrnumber = {803993},
     language = {fr},
     url = {http://www.numdam.org/item/ITA_1985__19_2_107_0/}
}
TY  - JOUR
AU  - Robert, Yves
AU  - Tchuente, Maurice
TI  - Réseaux systoliques pour des problèmes de mots
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1985
DA  - 1985///
SP  - 107
EP  - 123
VL  - 19
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1985__19_2_107_0/
UR  - https://zbmath.org/?q=an%3A0569.68063
UR  - https://www.ams.org/mathscinet-getitem?mr=803993
LA  - fr
ID  - ITA_1985__19_2_107_0
ER  - 
Robert, Yves; Tchuente, Maurice. Réseaux systoliques pour des problèmes de mots. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 19 (1985) no. 2, pp. 107-123. http://www.numdam.org/item/ITA_1985__19_2_107_0/

1. Y. M. Barzdin, Complexity of Recognition of Symmetry in Turing Machines, Problemy Kibernetiki, vol. 15, 1965.

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

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.

4. K. Culik Ii, J. Gruska et A. Salomaa, Systolic Treillis Automata for (VLSI), Research Report CS-81-36, University of Waterloo.

5. M. J. Foster and H. T. Kung, Recognize Regular Langages with Programmable Building-blocks, in the Proceedings of the VLSI, 1981, Conference, Edinburgh.

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

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.

8. H. T. Kung, Why Systolic Architectures, I.E.E.E. Computer, vol. 15, n° 1, janvier 1982, p. 37-46.

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.

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

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.

12. Y. Robert et M. Tchuente, Designing Efficient Systolic Algorithms, Rapport de Recherche 393, Lab. I.M.A.G., Grenoble, septembre 1983.

13. A. R. Smith Iii, Cellular Automata theory, Technical Report 2, Stanford Electronics Laboratories, décembre 1969.

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