Christoph M. Hoffmann
- 1 AHO, A.V., AND CORASICK, M J. 18, 6 Efficient string matching: an aid to bibliograpic search Commun. ACM 18,6 (June 1975), 333-340 Google Scholar
- 2 AHO, A.V, HOPCROFT, J.E., AND ULLMAN, J D. The Design and Analyas of Computer Algorithms. Addison-Wesley, Reading, Mass, 1974. Google Scholar
- 3 BAXTER, L.D.The complexity of unification. Ph.D. Dissertauon, Dep. of Computer Science, Univ. of Waterloo, Waterloo, Ontario, Canada, 1976 Google Scholar
- 3a BERRY, G, AND L~VY, J-J Minimal and optimal computations of recurs~ve programs. 4th ACM Symp. on Principles of Programming Languages, Los Angeles, Cahf, 1977, pp 215-226 Google Scholar
- 4 BOYER, R S., AND MOORE, J.S. A fast stnng searching algorithm Commun A CM 20, 10 (Oct 1977), 762-772 Google Scholar
- 5 CARTER, J L, AND WEGMAN, M.N Umversal classes of hashmg functions Proc 9th Arm. Syrup on Theory of Computmg, Boulder, ColD, 1977, pp 106-112. Google Scholar
- 6 CHEW, P An improved algorithm for computmg wath equauons Proc 21st IEEE Symp on Foundauons of Computer Soence, Syracuse, N.Y, 1980, pp. t08-117Google Scholar
- 7 COLLINS, G The SAC-I system" An mtroducuon and survey Proc 2rid ACM Conf on Symbolic and Algebraic Manipulation, Los Angeles, Cahf, 1971, pp 144-152 Google Scholar
- 8 COMMENTZ-WALTER, B A string matching algorithm fast on the average In Automata, Languages and Programming, Lecture Notes m Computer Science 71, H A Maurer, Ed, Sprmger-Verlag, Berhn, Heidelberg, New York, 1979, pp. 118-132. Google Scholar
- 9 DOWNEY, P J, SAMET, H, AND SETHI, R Off-hne and on-line algorithms for deducing equalities Proc 5th Ann ACM Syrup on PnncJples of Programming Languages, Tucson, Anz, 1978, pp. 158-170. Google Scholar
- 10 GLASNER, 1, MONCKE, U, AND WILHELM, R OPTRAN, a language for the speoficatton of program transformations 6th G I Fachtagung uber Programmiersprachen, Darmstadt, W Germany, 1980, to appear m Lecture Notes in Computer Soence Google Scholar
- 11 GOGUEN, J.A Some design principles and theory for Obj-0 Proc lnt Conf on Mathemaucal Studies of lnformauon Processing, Kyoto, Japan, 1978, pp 429-475. Google Scholar
- 12 GUTTAG, J, HOROWlTZ, E, AND MUSSER, D. Abstract data types and software vahdatmn. ISI Rep 76-48, Umv. of Southern California, Los Angeles, Cahf., 1976.Google Scholar
- 13 GUTTAG, J V, HOROWITZ, E, AND MUSSER, D R Abstract data types and software vahdauon Commun. ACM 21, 12 (Dec 1978), 1048-1064 Google Scholar
- 14 HOFFMANN, C M, AND O'DONNELL, M J An interpreter generator using tree pattern matching Proc. 6th Ann ACM Symp on Principles of Programming Languages, San Antonio, Texas, 1979, pp. 169-179 Google Scholar
- 15 HOFFMANN, C.M., AND O'DONNELL, M.J. Programming with equations A CM Trans Prog Lang Syst 4, 1 (Jan 1982) Google Scholar
- 16 HUET, G., AND LANG, B Proving and applying program transformations expressed with second order patterns Tech Pep 266, IRIA Labona, LeChesnay, France, 1977Google Scholar
- 17 HUET, G, AND LEVY, J-J Call by need computations in nonamblguous linear term rewrmng systems Tech. Pep 359, IRIA Laborla, LeChesnay, France, 1979.Google Scholar
- 18 KARP, R, MILLER, R E., AND ROSENBERG, A RapM tdenufication of repeated patterns in strings, trees and arrays Proc 4th Ann ACM Symp on Theory of Computing, Denver, Colo., 1972, pp 125-136 Google Scholar
- 19 KNUTH, D. The Art of Computer Programming, 1Ioi 3 Sorting and Searching Addison-Wesley, Reading, Mass, 1973 Google Scholar
- 20 KNUTH, D., AND BENDIX, P.Sample word problems in universal algebras In Computatwnal Problems m Abstract Algebra, J Leech, Ed, Pergamon Press, Elmsford, N Y, 1970. pp 263-297,Google Scholar
- 21 KNUTH, D., MORRIS, J, AND PRATT, V Fast pattern matching m strings. SIAM J Comput 6, 2 (1977), 323-350Google Scholar
- 22 KOZEN, D Complexity of fimtely presented algebras Proc 9th Ann. ACM Syrup on Theory of Computing, Boulder, ColD, 1977, pp 164-177 Google Scholar
- 23 KRON, H.Tree templates and subtree transformational grammars Ph D Dts~rtatlon, Umv of Cahtbrma, Santa Cruz, Cahf, 1975 Google Scholar
- 24 LANG, H -W, SCHIMMLER, M, AND SCHMECK, H Matching tree patterns subhnear on the average Tech Rep, Dep of lnformaak, Umv Klel, K~el, W Germany, 1980Google Scholar
- 25 NELSON, G, AND OPPEN, D Fast decision procedures based on congruence closure J A CM 2L 2 (April 1980), 356-364 Google Scholar
- 26 O'DONNELL, M J Computing m systems descrlbed by equations In Compunng and Systems Described by Equations, Lecture Notes tn Computer Science 58, G Goos and J Hartmarns, Eds, Sprmger-Verlag, 1977Google Scholar
- 27 OVERMARS, M H, AND VAN LEEUWEN, J Rapid subtree ,dentlficatton revisited Tech Rep CS-79-3, Umv of Utrecht, Utrecht, Netherlands, 1979Google Scholar
- 28 PATERSON, M S, AND WEGMAN, M Lmear unification Proc 8th ACM Symp on Theory of Computing, Hershey, Pa, t976, pp 181-186 Google Scholar
- 29 ROZINSON, J A A machine-oriented logic based on the resolution principle.I ACM 12, 1 (Jan 1965), 23-41 Google Scholar
- 30 ROSEN, B Tree-mampulatlng systems and Church-Rosser theorems J A CM 20, 1 (Jan 1973), 160-187. Google Scholar
- 31 ShoTAK, RE An algorithm for reasoning about equahty Commun ACM 21, 7 (July 1978), 583-585 Google Scholar
- 32 SPRUGNOI.t, R Perfect hash,ng functmns A single probe retrlewng method for static sets Commun ACM 20, 11 (Nov 1977), 841-850 Google Scholar
- 33 STAFFORD, G Structure of the Eh compiler Master's Thesis, Dep of Computer Soence, Umv of Waterloo, Waterloo, Ontario, Canada, i977Google Scholar
- 34 WAND, M Algebraic theories and tree rewrmng systems Tech Rep 66, Dep of Computer Science, Indiana Umv, Bloomington, Ind, 1977Google Scholar
Index Terms
- Pattern Matching in Trees
Recommendations
Nonlinear pattern matching in trees
Tree pattern matching is a fundamental operation that is used in a number of programming tasks such as mechanical theorem proving, term rewriting, symbolic computation, and nonprocedural programming languages. In this paper, we present new sequential ...
Tree template matching in unranked ordered trees
We consider the problem of tree template matching, a type of tree pattern matching, where the tree templates have some of their leaves denoted as ''don@?t care'', and propose a solution based on the bottom-up technique. Specifically, we transform the ...
Pattern matching with wildcards based on multiple suffix trees
GRC '12: Proceedings of the 2012 IEEE International Conference on Granular Computing (GrC-2012)Pattern matching with wildcards is very important in many fields such as information retrieval and bioinformatics. Suffix trees are used in pattern matching with variable length wildcards. But the construction of a suffix tree needs significant time and ...
Comments