Goto Chapter: Top 1 2 3 Bib Ind
 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 

References

[BGHW06] Brown, R., Ghani, N., Heyworth, A. and Wensley, C. D., String rewriting systems for double coset systems, J. Symbolic Comput., 41 (2006), 573–590.

[BH00] Brown, R. and Heyworth, A., Using rewriting systems to compute left Kan extensions and induced actions of categories, J. Symbolic Comput., 29 (2000), 5–31.

[Hey99] Heyworth, A., Applications of Rewriting Systems and Groebner Bases to Computing Kan Extensions and Identities Among Relations, Ph.D. thesis, University of Wales, Bangor (1999)
( http://www.maths.bangor.ac.uk/research/ftp/theses/heyworth.ps.gz ).

[Lin91] Linton, S., Double coset enumeration, J. Symbolic Comput., 12 (1991), 415–426.

 [Top of Book]  [Contents]   [Previous Chapter]   [Next Chapter] 
Goto Chapter: Top 1 2 3 Bib Ind

generated by GAPDoc2HTML