Summary
Rational patterns are used to specify recognizable tree languages. It is shown that, given a rational patternp and a treet, one can decide inO(¦p¦·¦t¦) steps whether there is some match ofp int. Problems of this kind generalized to forests or nets are shown to be NP-complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison Wesley Publishing Company, 1976
Hoffmann, C., O'Donnell, M.: Pattern Matching in Trees. JACM29, 68–95 (1982)
Hotz, G.: Eine Algebraisierung des Syntheseproblems von Schaltkreisen. EIK1, 185–205 (1965)
Hotz, G.: Datentypen NET und TREE in COMSKEE. Linguistische Arbeiten, neue Folge, Heft 3, 2. Saarbrücken 1979
Kron, H.: Practical Subtree Transformational Grammars. Master Thesis, University of California, Santa Cruz 1974
Kron, H.: Tree Templates and Subtree Transformational Grammars. Ph.D. Thesis, University of California, Santa Cruz 1975
Möncke, U.: An Incremental and Decremental Generator for Tree Analysers. Techn. Bericht der Universität des Saarlandes. Saarbrücken 1980
Simon, U.: Komplexitätsbetrachtungen rationaler Baum- und Netzmengen. Dissertation, Univ. des Saarlandes, Saarbrücken 1981
Thatcher, J.: Tree Automata: An Informal Introduction. Aho. A.V. (ed.). Currents in the Theory of Computing, Englewood Cliffs: Prentice Hall 1973
Wilhelm, R.: Computation and Use of Data Flow Information in Optimizing Compilers. Acta Informat.12, 209–225 (1979)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Simon, HU. Pattern matching in trees and nets. Acta Informatica 20, 227–248 (1983). https://doi.org/10.1007/BF01257084
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01257084