Mathematics – Group Theory
Scientific paper
2000-01-06
Mathematics
Group Theory
63 pages, 6 figures. A completely rewritten version of math/9805057. A slightly shortened version of this paper has been accep
Scientific paper
It is shown how to use a small finite state automaton in two variables in order to carry out the Knuth-Bendix process for rewriting words in a group in shortlex order. The two-variable automaton can be used to store an infinite set of rules and to carry out fast reduction of arbitrary words using this infinite set. We introduce a new operation, which we call welding, which applies to an arbitrary finite state automaton. We show how to improve on the standard subset construction to determinize a non-deterministic automaton under special conditions which hold in our situation.
Epstein David B. A.
Sanders Paul J.
No associations
LandOfFree
Knuth-Bendix for groups with infinitely many rules 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 Knuth-Bendix for groups with infinitely many rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Knuth-Bendix for groups with infinitely many rules will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-670579