Too much duplicating patterns represent nonregular languages

Consultar RECERCAT

Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2099.1/14274

Títol:	Too much duplicating patterns represent nonregular languages
Autor/a:	Ramos Garrido, Lander
Altres autors:	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.
Matèries:	-À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
Drets:	Attribution-NonCommercial-NoDerivs 3.0 Spain http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Tipus de document:	Treballs d'investigació/Fi de màster
Publicat per:	Universitat Politècnica de Catalunya
Compartir: