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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions
dc.contributor	Facultat d'Informàtica de Barcelona
dc.contributor	Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.contributor.author	Cases Muñoz, Rafel
dc.contributor.author	Díaz Cort, Josep
dc.date	1989-01
dc.identifier.citation	Cases, R., Diaz, J.. "On unification over unrestricted pairs of trees". 1989.
dc.identifier.uri	http://hdl.handle.net/2117/110572
dc.language.iso	eng
dc.relation	LSI-89-26
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Trees (Graph theory)
dc.subject	Binary trees
dc.subject	Arbres (Teoria de grafs)
dc.title	On unification over unrestricted pairs of trees
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.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.