Skip to main content
SpringerLink
Log in

ON tree pattern unification problems

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Included in the following conference series:

Abstract

The problem of many-to-one unification, i.e. a simultaneous unification of a given set of input pattern terms against the set of all subterms of a given input target term, is studied for linear terms. The proposed algorithms generalize either the many-to-one tree pattern matching algorithm based on the path counting principle or the rooted many-to-one tree pattern unification algorithm based on the pattern elimination principle. In both cases, the asymptotical worst-case time complexity of tree pattern unification is quadratic as in the special case of tree pattern matching. However, the expected time complexity of the “pattern-eliminating” algorithm is linear according to the size of input. A possibility of dynamization of the set of input pattern terms is discussed, too. While the “path-counting” algorithm is not adaptable to the dynamic version of the problem, it turns out that the “pattern-eliminating” algorithm is effective enough also in the case when the set of input pattern terms is changed during the computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V.-Corasick, M.J.: Efficient string matching: an aid to bibliographic search. CACM 16, 1975, pp.333–340.

    Google Scholar 

  2. Cai, J.-Paige,R.-Tarjan,R.: More efficient bottom-up pattern matching. In Proc. of the CAAP, LNCS 577, Springer-Verlag, 1992, pp.72–86.

    Google Scholar 

  3. Dubiner,M.-Galil,Z.-Magen,M.: Faster tree pattern matching. In Proc. of the 31-st FOCS, 1991, pp.145–150.

    Google Scholar 

  4. Hoffmann, C.M.-O'Donnell, M.J.: Pattern matching in trees. JACM 29, 1982, pp.68–95.

    Article  Google Scholar 

  5. Kosaraju,S.R.: Efficient tree pattern matching. In Proc. of the 30-th FOCS, 1989, pp.178–183.

    Google Scholar 

  6. O'Donnell, M.J.: Equational logic as a programming language. MIT Press, 1985.

    Google Scholar 

  7. Ramesh, R.-Ramakrishnan, J.V.: Nonlinear pattern matching in trees. JACM 39, 1992, pp.295–316.

    Article  Google Scholar 

  8. Ružička, P.-Prívara, I.: An almost linear Robinson unification algorithm. Acta Informatica 27, 1989, pp.61–71.

    Google Scholar 

  9. Ružička, P.-Prívara, I.: On tree pattern unification problems. Technical Report MFF-II-1993, Institute of Informatics, MFF, Comenius University, Bratislava, 1993.

    Google Scholar 

  10. Sekar,R.C.-Ramesh,R.-Ramakrishnan, I.V.: Adaptive pattern matching. In Proc. of the 19-th ICALP, LNCS 623, Springer-Verlag, 1992, pp.247–260.

    Google Scholar 

  11. Vittek,M.: Many-to-one unification for linear terms (in Slovak). In Proc. of the 2-nd LOP, 1989, pp.47–56.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Comenius University, MFF, Mlynská dolina, 842 43, Bratislava, Slovakia

    P. Ružička

  2. Institute of Informatics and Statistics, INFOSTAT, Dúbravská 3, 842 21, Bratislava, Slovakia

    I. Prívara

Authors
  1. P. Ružička
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Prívara
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ružička, P., Prívara, I. (1993). ON tree pattern unification problems. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-57163-9_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57163-6

  • Online ISBN: 978-3-540-47923-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation