On unification over unrestricted pairs of trees

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/110572

Title:	On unification over unrestricted pairs of trees
Author:	Cases Muñoz, Rafel; Díaz Cort, Josep
Other authors:	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
Abstract:	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.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Trees (Graph theory) -Binary trees -Arbres (Teoria de grafs)
Rights:
Document type:	Article - Published version Report
Share: