10 citations · 19 across the 11 of their papers we have counts for
9 papers · 1 filter
String rewriting for Double Coset Systems
Ronald Brown, Neil Ghani, Anne Heyworth +1
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 rest…
Logged Rewriting for Monoids
A. Heyworth, M. Johnson
A rewriting system is a set of equations over a given set of terms called rules that characterize a system of computation and is a powerful general method for providing decision pr…
Grobner Basis Techniques for Computing Actions of K-Categories
Anne Heyworth
This paper involves categories and computer science. The paper is motivated by a question which arises from two pieces of research. Firstly, the work of Brown and Heyworth which ex…
Groebner Basis Procedures for Testing Petri Nets
Angie Chandler, Anne Heyworth
This paper contains introductory material on Petri nets and Groebner basis theory and makes some observations on the relation between the two areas. The aim of the paper is to show…
Logged Rewriting Procedures with Application to Identities Among Relations
Anne Heyworth, Christopher D Wensley
The key idea is that rewriting procedures can be enhanced so that they not only rewrite words but record (log) how the rewriting has taken place. We introduce logged rewrite system…
Rewriting Procedures Generalise to Kan Extensions of Actions of Categories
Anne Heyworth
Kan extensions provide a natural general framework for a variety of combinatorial problems. We have developed rewriting procedures for Kan extensions (over the category of sets) an…
Using Automata to obtain Regular Expressions for Induced Actions
Anne Heyworth
Presentations of Kan extensions of category actions provide a natural framework for expressing induced actions, and therefore a range of different combinatorial problems. Rewrite s…
Using Rewriting Systems to Compute Kan Extensions and Induced Actions of Categories
Ronald Brown, Anne Heyworth
The basic method of rewriting for words in a free monoid given a monoid presentation is extended to rewriting for paths in a free category given a `Kan extension presentation'. Thi…
Rewriting as a Special Case of Noncommutative Groebner Basis Theory
Anne Heyworth
Rewriting for semigroups is a special case of Groebner basis theory for noncommutative polynomial algebras. The fact is a kind of folklore but is not fully recognised. The aim of t…