Too much duplicating patterns represent nonregular languages

All of RECERCAT

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

dc.contributor	Godoy Balil, Guillem
dc.contributor.author	Ramos Garrido, Lander
dc.date	2011
dc.identifier.uri	http://hdl.handle.net/2099.1/14274
dc.language.iso	eng
dc.publisher	Universitat Politècnica de Catalunya
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights	info:eu-repo/semantics/openAccess
dc.rights	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	Computer science
dc.subject	Tree Automata
dc.subject	Tree Homomorphism
dc.subject	Regularity
dc.subject	Informàtica
dc.subject	Classificació AMS::68 Computer science::68Q Theory of computing
dc.title	Too much duplicating patterns represent nonregular languages
dc.type	info:eu-repo/semantics/masterThesis
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.