Skip to main content
SpringerLink
Log in

Representation of recursively enumerable languages using alternating finite tree recognizers

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1989)

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

Included in the following conference series:

  • 140 Accesses

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. K. Chandra, D. C. Kozen and L. J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981) 114–133.

    Google Scholar 

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

    Google Scholar 

  3. J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages, and computation, Addison-Wesley, 1979.

    Google Scholar 

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

    Article  Google Scholar 

  5. D. E. Muller, A. Saoudi and P. E. Schupp, Alternating automata, the weak monadic theory of the tree, and its complexity, Proc. of 13th ICALP, Lect. Notes Comput. Sci. 226 (1986) 275–283.

    Google Scholar 

  6. D. E. Muller and P. E. Schupp, Alternating automata on infinite trees, Theoret. Comput. Sci. 54 (1987) 267–276.

    Article  Google Scholar 

  7. A. Salomaa, Formal languages, Academic Press, New York, 1973.

    Google Scholar 

  8. K. Salomaa, Alternating bottom-up tree recognizers, Proc. of 11th CAAP, Lect. Notes Comput. Sci. 214 (1986) 158–171.

    Google Scholar 

  9. K. Salomaa, Yield-languages recognized by alternating tree recognizers, RAIRO Inform. Théor. 22 (1988) 319–339.

    Google Scholar 

  10. K. Salomaa, Alternating tree pushdown automata, Ann. Univ. Turku Ser. AI 192 (1988).

    Google Scholar 

  11. G. Slutzki, Alternating tree automata, Proc. of 8th CAAP, Lect. Notes Comput. Sci. 159 (1983) 392–404.

    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

J. Csirik J. Demetrovics F. Gécseg

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Salomaa, K. (1989). Representation of recursively enumerable languages using alternating finite tree recognizers. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-51498-8_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51498-5

  • Online ISBN: 978-3-540-48180-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation