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

How to cite

top

Culik, Karel Ii, Salomaa, Arto, and Wood, Derick. "Systolic tree acceptors." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 18.1 (1984): 53-69. <http://eudml.org/doc/92200>.

@article{Culik1984,
author = {Culik, Karel Ii, Salomaa, Arto, Wood, Derick},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {tree automata; VLSI models; language acceptors; language family},
language = {eng},
number = {1},
pages = {53-69},
publisher = {EDP-Sciences},
title = {Systolic tree acceptors},
url = {http://eudml.org/doc/92200},
volume = {18},
year = {1984},
}

TY - JOUR
AU - Culik, Karel Ii
AU - Salomaa, Arto
AU - Wood, Derick
TI - Systolic tree acceptors
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1984
PB - EDP-Sciences
VL - 18
IS - 1
SP - 53
EP - 69
LA - eng
KW - tree automata; VLSI models; language acceptors; language family
UR - http://eudml.org/doc/92200
ER -

References

top
  1. 1. L. CONWAY and C. MEAD, Introduction to VLSI Systems, Addison-Wesley, 1980. 
  2. 2. K. CULIK II and H. A. MAURER, Tree Controlled Grammars, Computing, Vol. 19, 1977, pp. 129-139. Zbl0363.68108MR464718
  3. 3 G. ROZENBERG and A. SALOMAA, The Mathematical Theory of L Systems, Academic Press, 1980. Zbl0508.68031MR561711
  4. 4. A. SALOMAA, Formal Languages, Academic Press, 1973. Zbl0262.68025MR438755
  5. 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. 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. 7. K. CULIK II, J. GRUSKA and A. SALOMAA, Systolic Trellis Automata, International Journal of Computer Mathematics, to appear. Zbl0571.68042
  8. 8. C. R. DYER and A. ROSENFELD, Triangle Cellular Automata, Information and Control, Vol. 48, 1981, pp. 54-69. Zbl0459.68023MR629464
  9. 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. 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. 11. M. STEINBY, Systolic Trees and Systolic Language Recognition by Tree Automata, Theoretical Computer Science, to appear. Zbl0501.68046MR693057

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.