2026-04-14T07:27:05Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/1105722025-07-17T07:37:09Zcom_2072_1033col_2072_452950

On unification over unrestricted pairs of trees Cases Muñoz, Rafel Díaz Cort, Josep Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions Facultat d'Informàtica de Barcelona Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica Trees (Graph theory) Binary trees Arbres (Teoria de grafs) In this work, we deal with the unification of unrestricted (i.e. inifiable and non-unifiable) pais of binary trees with uniform probability distribution. The following results are obtained: Almost all pairs of binary trees are not unifiable. When considering unrestricted pairs of binary trees, drawn from a uniform distribution, the average time to process unification is constant. Postprint (published version) 1989-01 External research report Cases, R., Diaz, J.. "On unification over unrestricted pairs of trees". 1989. https://hdl.handle.net/2117/110572 eng LSI-89-26 Open Access 12 p. application/pdf