Mostra el registre d'ítem simple
On unification over unrestricted pairs of trees
| dc.contributor.author | Cases Muñoz, Rafel |
| dc.contributor.author | Díaz Cort, Josep |
| dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Teoria del Senyal i Comunicacions |
| dc.contributor.other | Facultat d'Informàtica de Barcelona |
| dc.date.accessioned | 2017-11-14T14:17:31Z |
| dc.date.available | 2017-11-14T14:17:31Z |
| dc.date.issued | 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.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. |
| dc.format.extent | 12 p. |
| dc.language.iso | eng |
| dc.relation.ispartofseries | LSI-89-26 |
| dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| dc.subject.lcsh | Trees (Graph theory) |
| dc.subject.other | Binary trees |
| dc.title | On unification over unrestricted pairs of trees |
| dc.type | External research report |
| dc.subject.lemac | Arbres (Teoria de grafs) |
| dc.contributor.group | Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals |
| dc.rights.access | Open Access |
| local.identifier.drac | 1855314 |
| dc.description.version | Postprint (published version) |
| local.citation.author | Cases, R.; Diaz, J. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [198]
-
Reports de recerca [139]