[1] Cohen, A. M., Cuypers, H. and Sterk, H., Some Tapas of Computer Algebra, Springer-Verlag, Heidelberg, Algorithms and Computation in Mathematics, 4 (1999).
[2] Cox, D., Little, J. and O'Shea, D.,
Ideals, varieties, and algorithms,
Springer-Verlag,
Second edition,
Undergraduate Texts in Mathematics,
New York
(1997)
(An introduction to computational algebraic geometry and
commutative algebra).
[3] Green, E. L.,
Noncommutative Gr\"obner bases and projective
resolutions,
in Computational Methods for Representations of Groups and
Algebras,
Birkh{\"a}user
(1999),
29-60
((Essen 1997)).
[4] Mora, T., An introduction to commutative and noncommutative Gr\"obner bases, Theoretical Computer Science, 134 (1) (1994), 131--173.
[5] Navarro, G. and Raffinot, M., Flexible Pattern Matching in Strings, Cambridge University Press (2002).
generated by GAPDoc2HTML