Systolic tree acceptors
Karel Ii Culik; Arto Salomaa; Derick Wood
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1984)
- Volume: 18, Issue: 1, page 53-69
- ISSN: 0988-3754
Access Full Article
topHow to cite
topReferences
top- 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. Zbl0363.68108MR464718
- 3 G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, 1980. Zbl0508.68031MR561711
- 4. A. SALOMAA, Formal Languages, Academic Press, 1973. Zbl0262.68025MR438755
- 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. Zbl0571.68042
- 8. C. R. DYER and A. ROSENFELD, Triangle Cellular Automata, Information and Control, Vol. 48, 1981, pp. 54-69. Zbl0459.68023MR629464
- 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. Zbl0501.68046MR693057