Nondeterministic Tree Automata

  • Frank Nießner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2500)


The automaton models introduced so far mainly differ in their acceptance conditions. However, they all consume infinite sequences of alphabet symbols, i.e., they consume ω-words. We therefore call these automata word automata. In this chapter we define finite-state automata which process infinite trees instead of infinite words and consequently we call them tree automata.


Transition Relation Successor State Winning Strategy Acceptance Condition Input Symbol 
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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Frank Nießner
    • 1
  1. 1.Institut für InformatikJohann Wolfgang Goethe-Universität Frankfurt am MainGermany

Personalised recommendations