Skip to main content
SpringerLink
Log in

Comparisons among classes of Y-tree systolic automata

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1990 (MFCS 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 452))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Culik II, J. Gruska, A. Salomaa, Systolic Automata for VLSI on Balanced Tree, Acta Informatica 16 (1983) 335–344.

    Google Scholar 

  2. K. Culik II, J. Gruska, A. Salomaa, On a Family of L Languages Resulting from Systolic Tree Automata, Theoret. Comp. Sci. 23 (1983) 231–242.

    Google Scholar 

  3. K. Culik II, A. Salomaa, D. Wood, Systolic Tree Acceptors, R.A.I.R.O. Inform. théor. 18 (1984) 53–69.

    Google Scholar 

  4. E. Fachini, R. Francese, M. Napoli, D, Parente, BC-tree Systolic Automata: Characterization and properties, J. Comput. and Art. Intel. 8 (1989) 53–82.

    Google Scholar 

  5. E. Fachini, J.Gruska, A. Maggiolo Schettini, D. Sangiorgi, Simulation of Systolic Tree Automata on Trellis Automata, Int. J. Found. Comp. Sci., to appear.

    Google Scholar 

  6. E. Fachini, J. Gruska, M. Napoli, D. Parente, Power of Interconnection and of Nondeterminism in Regular Y Tree Systolic Automata, in preparation.

    Google Scholar 

  7. E. Fachini, A. Maggiolo Schettini, G. Resta, D. Sangiorgi, Some Structural Properties of Systolic Tree Automata, Fund. Inform. XII (1989) 571–585.

    Google Scholar 

  8. J. Gruska, Systolic Automata: Power, Characterizations, Nonhomogeneity, in "Proceedings of MCFS '84", Lecture Notes in Computer Science 176, Springer, Berlin, 1984,32–49.

    Google Scholar 

  9. O.H. Ibarra, S.M. Kim, A Characterization of Systolic Binary Tree Automata and Applications, Acta Informatica 21 (1984) 193–207.

    Google Scholar 

  10. H.T. Kung, Why Systolic Architecture ?, Computer Magazine 15(1982),37–46.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica ed Applicazioni, Università di Salerno, 84081, Baronissi, Italy

    E. Fachini

  2. Dipartimento di Informatica, Università di Pisa, 56100, Pisa, Italy

    A. Maggiolo Schettini

  3. Department of Computer Science, University of Edinburgh, EH93JZ, Edinburgh, U.K.

    D. Sangiorgi

Authors
  1. E. Fachini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. Maggiolo Schettini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. D. Sangiorgi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Branislav Rovan

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fachini, E., Schettini, A.M., Sangiorgi, D. (1990). Comparisons among classes of Y-tree systolic automata. In: Rovan, B. (eds) Mathematical Foundations of Computer Science 1990. MFCS 1990. Lecture Notes in Computer Science, vol 452. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029616

Download citation

  • DOI: https://doi.org/10.1007/BFb0029616

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52953-8

  • Online ISBN: 978-3-540-47185-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation