Abstract
In this section we apply the realization theory of Section 2 to a class of systems in Set which have proved very important in computer science: the tree automata. Since the study of tree automata plays no role in the study of reachability and observability conditions in Section 4 (and only a partial role in Section 5), many control theorists may wish to omit this section unless they have an interest in theory of computation. (An overview of applications is given in Chapter 4 of [7]).
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin · Heidelberg
About this chapter
Cite this chapter
Anderson, B.D.O., Arbib, M.A., Manes, E.G. (1976). Tree Automata: Finite Successes and Infinite Failures. In: Foundations of System Theory: Finitary and Infinitary Conditions. Lecture Notes in Economics and Mathematical Systems, vol 115. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45479-0_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-45479-0_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07611-7
Online ISBN: 978-3-642-45479-0
eBook Packages: Springer Book Archive