Show simple item record

dc.contributor.authorGabarró Vallès, Joaquim
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2020-10-21T09:50:02Z
dc.date.available2020-10-21T09:50:02Z
dc.date.issued1991-10-15
dc.identifier.citationGabarro, J. The design of a parallel algorithm to solve the word problem for the free partially commutative groups. 1991.
dc.identifier.urihttp://hdl.handle.net/2117/330529
dc.description.abstractWe develop a parallel algorithm to solve the word problem for free partially commutative groups. These groups were introduced by C. Wrathall to generalize free groups. We represent the elements of these groups as a certain type of acyclic labeled graphs called dependency graphs. These graphs were introduced by A Maxurkiewicz to model concurrent systems. First we study the parallel complexity of some basic problems arising in the study of dependency graphs. Such as correctness, isomorphism and relations with traces. Parallel algorithms are developed to solve all of them. Second we consider the combinatorial properties of free partially commutative groups. To do this we associate to every group a rewriting system over dependency graphs. Finally we apply all these ideas to solve in parallel the word problem. Special emphasis is given in the design of the algorithms. The modular approach is widely used to obtain readable programs. It seems that many of the structuring techniques developed in sequential programming can be used directly in the PRAM context.
dc.format.extent15 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-91-39
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Informàtica
dc.subject.lcshParallel algorithms
dc.subject.lcshWord problems (Mathematics)
dc.subject.otherPRAMS
dc.subject.otherData parallel algorithms
dc.subject.otherModular design
dc.subject.otherTrace theory
dc.subject.otherFree groups
dc.subject.otherFree partially commutative groups
dc.subject.otherWord problems
dc.subject.otherParallel complexity classes
dc.subject.otherNC*
dc.subject.otherNL*
dc.subject.otherACo
dc.subject.otherComplete problems
dc.titleThe design of a parallel algorithm to solve the word problem for the free partially commutative groups
dc.typeExternal research report
dc.subject.lemacAlgorismes paral·lels
dc.subject.lemacParaules, Problemes de (Matemàtica)
dc.contributor.groupUniversitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
dc.rights.accessOpen Access
local.identifier.drac29600172
dc.description.versionPostprint (published version)
local.citation.authorGabarro, J.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain