Systolic tree acceptors
Culik, Karel Ii ; Salomaa, Arto ; Wood, Derick
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984), p. 53-69 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU) 
@article{ITA_1984__18_1_53_0,
     author = {Culik, Karel Ii and Salomaa, Arto and Wood, Derick},
     title = {Systolic tree acceptors},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {18},
     year = {1984},
     pages = {53-69},
     mrnumber = {750451},
     zbl = {0571.68043},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1984__18_1_53_0}
}

Culik, Karel Ii; Salomaa, Arto; Wood, Derick. Systolic tree acceptors. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 18 (1984) pp. 53-69. http://gdmltest.u-ga.fr/item/ITA_1984__18_1_53_0/

1. L. Conway and C. Mead, Introduction to VLSI Systems, Addison-Wesley, 1980.

2. K. Culik Ii and H. A. Maurer, Tree Controlled Grammars, Computing, Vol. 19, 1977, pp. 129-139. | MR 464718 | Zbl 0363.68108

3 G. Rozenberg and A. Salomaa, The Mathematical Theory of L Systems, Academic Press, 1980. | MR 561711 | Zbl 0508.68031

4. A. Salomaa, Formal Languages, Academic Press, 1973. | MR 438755 | Zbl 0262.68025

5. H. T. Kung, Let's Design Algorithms for VLSI Systems, Proceedings of the Caltech Conference on VLSI, Charles L. Seitz, Ed., Pasadena, California, January 1979, pp. 65-90.

6. C. E. Leiserson and J. B. Saxe, Optimizing Synchronous Systems, 22nd Annual Symposium on Foundations of Computer Science, October 1981, pp. 270-281.

7. K. Culik Ii, J. Gruska and A. Salomaa, Systolic Trellis Automata, International Journal of Computer Mathematics, to appear. | Zbl 0571.68042

8. C. R. Dyer and A. Rosenfeld, Triangle Cellular Automata, Information and Control, Vol. 48, 1981, pp. 54-69. | MR 629464 | Zbl 0459.68023

9. R. W. Floyd and J. D. Ullman, The Compilation of Regular Expressions into Integrated Circuits, Proceedings 21st Annual Symposium on Foundations of Computer Science, I.E.E.E. Computer Society, 1980, pp. 260-269.

10. M. J. Foster, and H. T. Kung, Recognizable Regular Languages with Programmable Building-Blocks, in J. P. GRAY, Ed., VLSI 81, Academic Press 1981, pp. 75-84.

11. M. Steinby, Systolic Trees and Systolic Language Recognition by Tree Automata, Theoretical Computer Science, to appear. | MR 693057 | Zbl 0501.68046