Automatic groups associated with word orders other than shortlex

Details Automatic groups associated with word orders other than shortlex Automatic groups associated with word orders other than shortlex

1997-05-28

arxiv.org/abs/math/9705208v1

Mathematics

Group Theory

DVI and Post-Script files only, 27 pages. Accepted by the International Journal of Algebra and Computation

Scientific paper

The existing algorithm to compute and verify the automata associated with an automatic group deals only with the subclass of shortlex automatic groups. This paper describes the extension of the algorithm to deal with automatic groups associated with other word orders (the algorithm has now been implemented ) and reports on the use of the algorithm for specific examples; in particular a very natural automatic (or asynchonously automatic) structure for the Baumslag-Solitar and related classes of groups (closely related to one described for some of those groups by Epstein et al. is found from a wreath product order over shortlex.

Affiliated with

Also associated with

No associations

Rating

Automatic groups associated with word orders other than shortlex 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 Automatic groups associated with word orders other than shortlex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Automatic groups associated with word orders other than shortlex will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78800