Applications of substring searching to group presentations

Details Applications of substring searching to group presentations Applications of substring searching to group presentations

1994-06-15

arxiv.org/abs/math/9406204v1

Australian Computer Science Communications, Vol. 15, No. 1, February 1993, pp. 587-593

Mathematics

Group Theory

Scientific paper

An important way for describing groups is by finite presentations. Large presentations arise in practice which are poorly suited for either human or computer use. Presentation simplification processes which take bad presentations and produce good presentations have been developed. Substantial use is made of substring searching and appropriate techniques for this context are described. Effective use is made of signatures and change flags. Change flags are shown to be the most beneficial of the methods tested here, with very significant performance improvement. Experimental performance figures are given.

Affiliated with

Also associated with

No associations

Rating

Applications of substring searching to group presentations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Applications of substring searching to group presentations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Applications of substring searching to group presentations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653126