loading...
An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups
Punta Arenas, Chile November 07-November 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SCCC.2001.972635XXI International Conference of the C ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Luiz M.R. Gadelha Jr., Mauricio Ayala-Rincón, "An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups," Chilean Computer Science Society, International Conference of the, pp. 0080, XXI International Conference of the Chilean Computer Science Society (SCCC'01), 2001.
 
 
BibTex
x
 
@article{ 10.1109/SCCC.2001.972635,
author = {Luiz M.R. Gadelha Jr. and Mauricio Ayala-Rincón},
title = {An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups},
journal ={Chilean Computer Science Society, International Conference of the},
volume = {0},
year = {2001},
isbn = {0-7695-1396-4},
pages = {0080},
doi = {http://doi.ieeecomputersociety.org/10.1109/SCCC.2001.972635},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Chilean Computer Science Society, International Conference of the
TI - An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups
SN - 0-7695-1396-4
SP
EP
A1 - Luiz M.R. Gadelha Jr.,
A1 - Mauricio Ayala-Rincón,
PY - 2001
KW - String-Rewriting Systems
KW - Knuth-Bendix Completion
KW - Word Problem in Finitely Presented Groups
VL - 0
JA - Chilean Computer Science Society, International Conference of the
ER -
 
Luiz M.R. Gadelha Jr., Universidade de Bras?lia
Mauricio Ayala-Rincón, Universidade de Bras?lia
We present an efficient strategy for the application of the inference rules of a completion procedure for finitely presented groups. This procedure has been proposed by Cremanns and Otto and uses a combinatorial structure called word-cycle. Our strategy is complete in the sense that a set of persistent word-cycles can be used to solve the reduced word problem of the finitely presented group given as input. This procedure has been implemented in order to experiment with various examples of groups.
Index Terms:
String-Rewriting Systems, Knuth-Bendix Completion, Word Problem in Finitely Presented Groups
Citation:
Luiz M.R. Gadelha Jr., Mauricio Ayala-Rincón, "An Efficient Strategy for Word-Cycle Completion in Finitely Presented Groups," sccc, pp.0080, XXI International Conference of the Chilean Computer Science Society (SCCC'01), 2001
Usage of this product signifies your acceptance of the Terms of Use.