论文信息 - Réseaux Systoliques Pour des Problèmes de Mots

Réseaux Systoliques Pour des Problèmes de Mots

Presentation de reseaux systoliques pour la resolution en temps reels de problemes de convolutions generalisees. On a en vue la definition d'architectures systoliques d'efficacite maximale a partir d'une approche de type «divide and conquer». On donne trois applications a des problemes de mots: 1) le calcul du nombre d'occurences d'un mot dans une chaine; 2) la reconnaissance des palindromes et 3) la reconnaissance des carres

Yves Robert | Maurice Tchuente

[1] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[2] H. T. Kung. Why systolic architectures? , 1982, Computer.

[3] David W. L. Yen,et al. Systolic Processing and an Implementation for Signal and Image Processing , 1982, IEEE Transactions on Computers.

[4] Arto Salomaa,et al. On a Family of L Languages Resulting from Systolic Tree Automata , 1983, Theor. Comput. Sci..

[5] Stephen N. Cole. Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines , 1969, IEEE Trans. Computers.

[6] H. T. Kung,et al. Recognize Regular Languages with Programmable Building-Blocks. , 1981 .

[7] Charles E. Leiserson,et al. Optimizing synchronous systems , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8] Magnus Steinby,et al. Systolic Trees and Systolic Language Recognition by Tree Automata , 1983, Theor. Comput. Sci..

[9] Alvy Ray Smith,et al. Cellular automata theory , 1969 .

[10] H. T. Kung,et al. Systolic (VLSI) arrays for relational database operations , 1980, SIGMOD '80.

[11] Ellis Horowitz,et al. Divide-and-Conquer for Parallel Processing , 1983, IEEE Transactions on Computers.