A good introduction to string rewriting is [2], and a recent introduction to noncommutative GrÃ¶bner basis theory is [12]. Similarities between the two critical pair completion methods (KnuthBendixâ€¦ (More)

The designing and testing of the Petri net models for the mobile robot is done initially in component form, providing a model which is then automatically converted into a GrÃ¶bner basis to provide aâ€¦ (More)

One problem in computational group theory is to find a presentation of the subgroup generated by a set of elements of a group. The Reidemeister-Schreier algorithm was developed in the 1930â€™s andâ€¦ (More)

Standard noncommutative GrÃ¶bner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes GrÃ¶bner basis procedures for one-sided idealsâ€¦ (More)

In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finiteâ€¦ (More)

The aim is to apply string-rewriting methods to compute left Kan extensions, or, equivalently, induced actions of monoids, categories, groups or groupoids. This allows rewriting methods to be appliedâ€¦ (More)

This paper contains introductory material on Petri nets and GrÃ¶bner basis theory and makes some observations on the relation between the two areas. The aim of the paper is to show how GrÃ¶bner basisâ€¦ (More)

The kan package was originally implemented in 1997 using the GAP 3 language, to compute induced actions of categories, when the first author was studying for a Ph.D. in Bangor. This reduced versionâ€¦ (More)