Skip to main content
SpringerLink
Log in

Alternating bottom-up tree recognizers

  • Tree-Automata And Transducers
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

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

Included in the following conference series:

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. A. Arnold, M. Dauchet: Une théorème de duplication pour les forêts algébriques, J. Comput. Syst. Sci. 13, 223–244, (1976).

    Google Scholar 

  2. A. Arnold, M. Dauchet: Forêts Algébriques et Homomorphismes Inverses, Inf. Control 37, 182–196, (1978).

    Google Scholar 

  3. A.K. Chandra, D.C. Kozen, L.J. Stockmeyer: Alternation, J. ACM 28, 114–133, (1981).

    Google Scholar 

  4. F. Gécseg, M. Steinby: Tree automata, Akadémiai Kiadó, Budapest, 1984.

    Google Scholar 

  5. T. Kamimura: Tree Automata and Attribute Grammars, Inf. Control 57, 1–20, (1983).

    Google Scholar 

  6. R.E. Ladner, R.J. Lipton, L.J. Stockmeyer: Alternating pushdown and stack automata, SIAM J. Comput. 13, 135–155, (1984).

    Google Scholar 

  7. A.Salomaa: Formal Languages, Academic Press, 1973.

    Google Scholar 

  8. G. Slutzki: Alternating tree automata, Proc. CAAP'83, Lect. Notes Comput. Sci. 159, 392–404, (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, SF-20500, Turku, Finland

    Kai Salomaa

Authors
  1. Kai Salomaa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Salomaa, K. (1986). Alternating bottom-up tree recognizers. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022666

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation