✦ LIBER ✦

Pattern matching in trees and nets

✍ Scribed by Hans-Ulrich Simon

Publisher: Springer-Verlag
Year: 1983
Tongue: English
Weight: 766 KB
Volume: 20
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf01257084

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel tree pattern matching

✍ R. Ramesh; I.V. Ramakrishnan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 819 KB

Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as code optimization in compilers, symbolic computation, automatic theorem proving and term rewriting. An important special case of this operation is linear tree pattern matching in which an instance

A parallel algorithm for tree pattern ma

A parallel algorithm for tree pattern matching

✍ Koji Tarora; Tomio Hirata; Yasuyoshi Inagaki 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 814 KB

## Abstract Given a text tree __t__ and a pattern tree __p__, tree pattern matching involves finding subtrees of __t__ which match __p.__ This paper proposed a parallel algorithm for tree pattern matching. The algorithm is designed to run in __O__(log __n__) parallel time using __mn__/log__n__ proc

Pattern Matching in Hypertext

✍ Amihood Amir; Moshe Lewenstein; Noa Lewenstein 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 142 KB

The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext format, with data organized associatively rather than sequentially or relationally. A myriad of textual problems have been considered in the pattern matching field wit

A new algorithm for linear regular tree

A new algorithm for linear regular tree pattern matching

✍ Priti Shankar; Amitranjan Gantait; A.R. Yuvaraj; Maya Madhavan 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 129 KB

We consider the problem of linear regular tree pattern matching and describe a new solution based on a bottom up technique. Current bottom up techniques preprocess the patterns and construct a ÿnite state tree pattern matching automaton for the purpose. Though matching time is linear in the size of

Matchings in starlike trees

✍ I. Gutman; O. Araujo; J. Rada 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 250 KB

## Let m(G,k) be the number of k-matchings in the graph G. We write G1 -~ G2 if m(Gl,k) <\_ m(G2,k) for all k = 1,2,.... A tree is said to be starlike if it possesses exactly one vertex of degree greater than two. The relation T1 -~ T2 is shown to hold for various pairs of starlike trees T1,T2. T

Fastest Pattern Matching in Strings

✍ L. Colussi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given