Mostra el registre d'ítem simple
Learning expressions and programs over monoids
dc.contributor.author | Gavaldà Mestre, Ricard |
dc.contributor.author | Tesson, Pascal |
dc.contributor.author | Thérien, Denis |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-12-07T11:59:57Z |
dc.date.available | 2016-12-07T11:59:57Z |
dc.date.issued | 2001-09 |
dc.identifier.citation | Gavaldà, R., Tesson, P., Thérien, D. "Learning expressions and programs over monoids". 2001. |
dc.identifier.uri | http://hdl.handle.net/2117/97847 |
dc.description.abstract | We study the problem of learning an unknown function represented as an expression or a program over a known finite monoid. As in other areas of computational complexity where programs over algebras have been used, the goal is to relate the computational complexity of the learning problem with the algebraic complexity of the finite monoid. Indeed, our results indicate a close connection between both kinds of complexity. We present results for Abelian, nilpotent, solvable, and nonsolvable groups, as well as for some important subclasses of aperiodic monoids. |
dc.format.extent | 41 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-01-38-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica |
dc.subject.other | Monoids |
dc.subject.other | Computational complexity |
dc.subject.other | Expressions learning |
dc.subject.other | Programs learning |
dc.title | Learning expressions and programs over monoids |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1893846 |
dc.description.version | Postprint (published version) |
local.citation.author | Gavaldà, R.; Tesson, P.; Thérien, D. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]