no. 1
Systolic tree acceptors
RAIRO. Informatique théorique, Tome 18 (1984) no. 1, pp. 53-69. 
@article{ITA_1984__18_1_53_0,
     author = {Culik, Karel Ii and Salomaa, Arto and Wood, Derick},
     title = {Systolic tree acceptors},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {53--69},
     publisher = {EDP-Sciences},
     volume = {18},
     number = {1},
     year = {1984},
     mrnumber = {750451},
     zbl = {0571.68043},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1984__18_1_53_0/}
}
TY  - JOUR
AU  - Culik, Karel Ii
AU  - Salomaa, Arto
AU  - Wood, Derick
TI  - Systolic tree acceptors
JO  - RAIRO. Informatique théorique
PY  - 1984
SP  - 53
EP  - 69
VL  - 18
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1984__18_1_53_0/
LA  - en
ID  - ITA_1984__18_1_53_0
ER  - 
%0 Journal Article
%A Culik, Karel Ii
%A Salomaa, Arto
%A Wood, Derick
%T Systolic tree acceptors
%J RAIRO. Informatique théorique
%D 1984
%P 53-69
%V 18
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1984__18_1_53_0/
%G en
%F ITA_1984__18_1_53_0
Culik, Karel Ii; Salomaa, Arto; Wood, Derick. Systolic tree acceptors. RAIRO. Informatique théorique, Tome 18 (1984) no. 1, pp. 53-69. http://www.numdam.org/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 | Zbl

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

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

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

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

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 | Zbl