Mostra el registre d'ítem simple

dc.contributorGodoy Balil, Guillem
dc.contributor.authorRamos Garrido, Lander
dc.date.accessioned2012-02-17T12:59:15Z
dc.date.available2012-02-17T12:59:15Z
dc.date.issued2011
dc.identifier.urihttp://hdl.handle.net/2099.1/14274
dc.description.abstractA 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.isoeng
dc.publisherUniversitat Politècnica de Catalunya
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshComputer science
dc.subject.otherTree Automata
dc.subject.otherTree Homomorphism
dc.subject.otherRegularity
dc.titleToo much duplicating patterns represent nonregular languages
dc.typeMaster thesis
dc.subject.lemacInformàtica
dc.subject.amsClassificació AMS::68 Computer science::68Q Theory of computing
dc.rights.accessOpen Access
dc.audience.educationlevelMàster
dc.audience.mediatorUniversitat Politècnica de Catalunya. Facultat de Matemàtiques i Estadística
dc.audience.degreeMÀSTER UNIVERSITARI EN MATEMÀTICA APLICADA (Pla 2009)


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple