Alternating bottom-up tree recognizers

  • Kai Salomaa
Tree-Automata And Transducers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)


Active Node Regular Language Computation Tree Input Tree Tree Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [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. [2]
    A. Arnold, M. Dauchet: Forêts Algébriques et Homomorphismes Inverses, Inf. Control 37, 182–196, (1978).Google Scholar
  3. [3]
    A.K. Chandra, D.C. Kozen, L.J. Stockmeyer: Alternation, J. ACM 28, 114–133, (1981).Google Scholar
  4. [4]
    F. Gécseg, M. Steinby: Tree automata, Akadémiai Kiadó, Budapest, 1984.Google Scholar
  5. [5]
    T. Kamimura: Tree Automata and Attribute Grammars, Inf. Control 57, 1–20, (1983).Google Scholar
  6. [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. [7]
    A.Salomaa: Formal Languages, Academic Press, 1973.Google Scholar
  8. [8]
    G. Slutzki: Alternating tree automata, Proc. CAAP'83, Lect. Notes Comput. Sci. 159, 392–404, (1983).Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Kai Salomaa
    • 1
  1. 1.Department of MathematicsUniversity of TurkuTurkuFinland

Personalised recommendations