Too much duplicating patterns represent nonregular languages

View/Open
Document typeMaster thesis
Date2011
Rights accessOpen Access
Except where otherwise noted, content on this work
is licensed under a Creative Commons license
:
Attribution-NonCommercial-NoDerivs 3.0 Spain
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.
DegreeMÀSTER UNIVERSITARI EN MATEMÀTICA APLICADA (Pla 2009)
Files | Description | Size | Format | View |
---|---|---|---|---|
memoria-2.pdf | 480,1Kb | View/Open |