Abstract
Restarting tree automata are an extension of top-down tree automata that incorporate transformations of trees through the execution of certain size-reducing rewrite operations. An input tree is repeatedly rewritten until a simple tree is obtained that is then accepted without further rewrites. Accordingly, these automata can be seen as term-rewriting systems with an incorporated regular control realizing parallel rewrites on independent branches. Here we introduce and study two restricted types of restarting tree automata by restricting the options for the regular control. The first variant we consider is the single-path restarting tree automaton, which is obtained from the general model by restricting it to the ability to pass down information along a single path only. In this way it is enforced that rewrites are executed in a strictly sequential way. Interestingly, single-path restarting tree automata reduce the tree languages they recognize to a proper subclass of the class of regular tree languages. Nevertheless, many of the results on the general model of restarting automata carry over to this variant. The second variant we study is the ground-rewrite restarting tree automaton. It is required to perform its size-reducing rewrite steps only on ground terms of bounded height. Accordingly, these automata can be interpreted as ground term-rewriting systems with additional regular control. Although they are much less expressive than the general model, it turns out that due to an inherent synchronization mechanism they can still accept certain non-regular tree languages. Finally, we consider the combination of both restrictions.
The results presented here are mostly taken from Heiko Stamer’s doctoral dissertation [8], where the proofs can be found in full detail.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (September 2005)
Fujiyoshi, A., Kasai, T.: Spinal-formed context-free tree grammars. Theory of Computing Systems 33, 59–83 (2000)
Gécseg, F., Steinby, M.: Tree Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, pp. 1–68. Springer, Heidelberg (1997)
Jančar, P., Mráz, F., Plátek, M., Vogel, J.: Restarting automata. In: Reichel, H. (ed.) FCT 1995. LNCS, vol. 965, pp. 283–292. Springer, Heidelberg (1995)
Mráz, F., Plátek, M., Procházka, M.: On special forms of restarting automata. Grammars 2, 223–233 (1999)
Otto, F.: Restarting automata. In: Ésik, Z., Martín-Vide, C., Mitrana, V. (eds.) Recent Advances in Formal Languages and Applications. Studies in Computational Intelligence, vol. 25, pp. 269–303. Springer, Heidelberg (2006)
Plátek, M.: Weak cyclic forms of restarting automata. In: Rozenberg, G., Thomas, W. (eds.) DLT 1999, Proc., pp. 115–124. World Scientific, Singapore (2000)
Stamer, H.: Restarting Tree Automata – Formal Properties and Possible Variations. Doctoral Dissertation, Fachbereich Elektrotechnik/Informatik, Universität Kassel (2008)
Stamer, H., Otto, F.: Restarting tree automata. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Plášil, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 510–521. Springer, Heidelberg (2007)
Stamer, H., Otto, F.: Restarting tree automata and linear context-free tree languages. In: Bozapalidis, S., Rahonis, G. (eds.) CAI 2007. LNCS, vol. 4728, pp. 275–289. Springer, Heidelberg (2007)
Vijay-Shankar, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27, 511–546 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otto, F., Stamer, H. (2009). Single-Path Restarting Tree Automata. In: Bozapalidis, S., Rahonis, G. (eds) Algebraic Informatics. CAI 2009. Lecture Notes in Computer Science, vol 5725. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03564-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-03564-7_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03563-0
Online ISBN: 978-3-642-03564-7
eBook Packages: Computer ScienceComputer Science (R0)