Show simple item record

dc.contributor.authorGavaldà Mestre, Ricard
dc.contributor.authorTesson, Pascal
dc.contributor.authorThérien, Denis
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-12-07T11:59:57Z
dc.date.available2016-12-07T11:59:57Z
dc.date.issued2001-09
dc.identifier.citationGavaldà, R., Tesson, P., Thérien, D. "Learning expressions and programs over monoids". 2001.
dc.identifier.urihttp://hdl.handle.net/2117/97847
dc.description.abstractWe 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.extent41 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-01-38-R
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.otherMonoids
dc.subject.otherComputational complexity
dc.subject.otherExpressions learning
dc.subject.otherPrograms learning
dc.titleLearning expressions and programs over monoids
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1893846
dc.description.versionPostprint (published version)
local.citation.authorGavaldà, R.; Tesson, P.; Thérien, D.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record