Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Nießner, F. (2002). Nondeterministic Tree Automata. In: Grädel, E., Thomas, W., Wilke, T. (eds) Automata Logics, and Infinite Games. Lecture Notes in Computer Science, vol 2500. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36387-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-36387-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00388-5
Online ISBN: 978-3-540-36387-3
eBook Packages: Springer Book Archive