Mostra el registre d'ítem simple
Too much duplicating patterns represent nonregular languages
dc.contributor | Godoy Balil, Guillem |
dc.contributor.author | Ramos Garrido, Lander |
dc.date.accessioned | 2012-02-17T12:59:15Z |
dc.date.available | 2012-02-17T12:59:15Z |
dc.date.issued | 2011 |
dc.identifier.uri | http://hdl.handle.net/2099.1/14274 |
dc.description.abstract | A constrained term pattern s:phi represents the language of all instances of the term s satisfying the constraint phi. For each variable in s, this constraint specifies the language of its allowed substitutions. The goal of this project is to find efficient and computable properties ensuring non-regularity of the language represented by a set of constrained patterns.. A constrained term pattern s:phi represents the language of all instances of the term s satisfying the constraint phi. For each variable in s, this constraint specifies the language of its allowed substitutions.The goal of this project is to find efficient and computable properties ensuring non-regularity of the language represented by a set of constrained patterns. |
dc.language.iso | eng |
dc.publisher | Universitat Politècnica de Catalunya |
dc.rights | Attribution-NonCommercial-NoDerivs 3.0 Spain |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ |
dc.subject | Àrees temàtiques de la UPC::Matemàtiques i estadística |
dc.subject.lcsh | Computer science |
dc.subject.other | Tree Automata |
dc.subject.other | Tree Homomorphism |
dc.subject.other | Regularity |
dc.title | Too much duplicating patterns represent nonregular languages |
dc.type | Master thesis |
dc.subject.lemac | Informàtica |
dc.subject.ams | Classificació AMS::68 Computer science::68Q Theory of computing |
dc.rights.access | Open Access |
dc.audience.educationlevel | Màster |
dc.audience.mediator | Universitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística |
dc.audience.degree | MÀSTER UNIVERSITARI EN MATEMÀTICA APLICADA (Pla 2009) |