Author of the publication

On the Editing Distance Between Unordered Labeled Trees.

, , and . Inf. Process. Lett., 42 (3): 133-139 (1992)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

On sets of terms with a given intersection type.. CoRR, (2018)On Cartesian Monoids.. CSL, volume 1258 of Lecture Notes in Computer Science, page 446-459. Springer, (1996)On Statman's Finite Completeness Theorem., and . CoRR, (2023)On sets of terms having a given intersection type., and . Log. Methods Comput. Sci., (2022)The Completeness of BCD for an Operational Semantics.. TYPES, volume 97 of LIPIcs, page 15:1-15:5. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems.. Theor. Comput. Sci., (1981)Lambda theories allowing terms with a finite number of fixed points., and . Math. Struct. Comput. Sci., 27 (3): 405-427 (2017)Worst Case Exponential Lower Bounds for Input Resolution with Paramodulation.. SIAM J. Comput., 9 (1): 104-110 (1980)Inductive Inference: An Abstract Approach., , and . COLT, page 251-266. ACM/MIT, (1988)On the Word Problem for Combinators.. RTA, volume 1833 of Lecture Notes in Computer Science, page 203-213. Springer, (2000)