Too much duplicating patterns represent nonregular languages

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2099.1/14274

Título:	Too much duplicating patterns represent nonregular languages
Autor/a:	Ramos Garrido, Lander
Otros autores:	Godoy Balil, Guillem
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.
Materia(s):	-Àrees temàtiques de la UPC::Matemàtiques i estadística -Computer science -Tree Automata -Tree Homomorphism -Regularity -Informàtica -Classificació AMS::68 Computer science::68Q Theory of computing
Derechos:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Tipo de documento:	Trabajo fin de máster
Editor:	Universitat Politècnica de Catalunya
Compartir: