Abstract
We deal with matching and locating of patterns in forests of variable arity. A pattern consists of a structural and a contextual condition for subtrees of a forest, both of which are given as tree or forest regular languages. We use the notation of constraint systems to uniformly specify both kinds of conditions. In order to implement pattern matching we introduce the class of pushdown forest automata. We identify a special class of contexts such that not only pattern matching but also locating all of a forest’s subtrees matching in context can be performed in a single traversal. We also give a method for computing the reachable states of an automaton in order to minimize the size of transition tables.
This is a preview of subscription content, log in via an institution to check access.
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
Biehl, M., Klarlund, N., Rauhe, T.: Algorithms for guided tree automata. In: Raymond, D.R., Yu, S., Wood, D. (eds.) WIA 1996. LNCS, vol. 1260, Springer, Heidelberg (1997)
Börstler, J., Möncke, U., Wilhelm, R.: Table Compression for Tree Automata. ACM TOPLAS 13(3), 295–314 (1991)
Brainerd, W.S.: Tree Generating Regular Systems. Information and Control 14, 217–231 (1969)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981)
Fecht, C., Seidl, H.: Propagating Differences: An Efficient New Fixpoint Algorithm for Distributive Constraint Systems. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol. 1381, pp. 90–104. Springer, Heidelberg (1998)
Goldfarb, C.F.: The SGML Handbook. Clarendon Press, Oxford (1990)
LeCharlier, B., Van Hentenryck, P.: A Universal Top-Down Fixpoint Algorithm. Technical Report CS-92-25, Brown University, Providence (1992)
Moriya, E.: On two-way tree automata. IPL 50, 117–121 (1994)
Murata, M.: Transformations of Trees and Schemas by Patterns and Contextual Conditions. In: Nicholas, C., Wood, D. (eds.) PODDP 1996 and PODP 1996. LNCS, vol. 1293, pp. 153–169. Springer, Heidelberg (1997)
Maurer, D., Wilhelm, R.: Compiler Design. Addison-Wesley, Reading (1995)
Neumann, A., Seidl, H.: Locating Matches of Tree Patterns in Forests. Technical Report 98-08, Mathematik/Informatik, Universität Trier (1998)
Podelski, A.: A Monoid Approach to Tree Automata. In: Nivat, M., Podelski, A. (eds.) Tree Automata and Languages, pp. 41–56. North Holland, Amsterdam (1992)
Pair, C., Quere, A.: Définition et Etude des Bilangages Réguliers. Information and Control 13, 565–593 (1968)
Shankar, P., Gantait, A., Yuvaraj, A.R., Madhavan, M.: A New Algorithm for Linear Regular Tree Pattern Matching. Submitted to TCS (1998)
Takahashi, M.: Generalizations of Regular Sets and their Application to a Study of Context-Free Languages. Information and Control 27, 1–36 (1975)
Thatcher, J.W.: Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory. JCSS 1, 317–322 (1967)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Neumann, A., Seidl, H. (1998). Locating Matches of Tree Patterns in Forests. In: Arvind, V., Ramanujam, S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1998. Lecture Notes in Computer Science, vol 1530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49382-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-49382-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65384-4
Online ISBN: 978-3-540-49382-2
eBook Packages: Springer Book Archive