Réseaux systoliques pour des problèmes de mots
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1985)
- Volume: 19, Issue: 2, page 107-123
- ISSN: 0988-3754
Access Full Article
top
How to cite
topRobert, Yves, and Tchuente, Maurice. "Réseaux systoliques pour des problèmes de mots." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 19.2 (1985): 107-123. <http://eudml.org/doc/92225>.
@article{Robert1985,
author = {Robert, Yves, Tchuente, Maurice},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {systolic arrays; real time solution; general convolution problems; divide-and-conquer; words problems; occurrences of a give word in a string; real-time palindrome recognizer; real-time square acceptor},
language = {fre},
number = {2},
pages = {107-123},
publisher = {EDP-Sciences},
title = {Réseaux systoliques pour des problèmes de mots},
url = {http://eudml.org/doc/92225},
volume = {19},
year = {1985},
}
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
PB - EDP-Sciences
VL - 19
IS - 2
SP - 107
EP - 123
LA - fre
KW - systolic arrays; real time solution; general convolution problems; divide-and-conquer; words problems; occurrences of a give word in a string; real-time palindrome recognizer; real-time square acceptor
UR - http://eudml.org/doc/92225
ER -
References
top- 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. Zbl0172.20804MR250518
- 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. Zbl0549.68081
- 4. K. CULIK II, J. GRUSKA et A. SALOMAA, Systolic Treillis Automata for (VLSI), Research Report CS-81-36, University of Waterloo. Zbl0493.68054
- 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. Zbl0513.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. Zbl0404.68037MR566379
- 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. Zbl0501.68046MR693057
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.