  
  
  [1XReferences[101X
  
  [[20X1[120X] [16XCohen, A. M., Cuypers, H. and Sterk, H.[116X, [17XSome Tapas of Computer Algebra[117X,
  Springer-Verlag,  Heidelberg,  Algorithms  and Computation in Mathematics, [19X4[119X
  (1999).
  
  [[20X2[120X]  [16XCox,  D., Little, J. and O'Shea, D.[116X, [17XIdeals, varieties, and algorithms[117X,
  Springer-Verlag,  Second  edition,  Undergraduate  Texts in Mathematics, New
  York  (1997),  ((An  introduction  to  computational  algebraic geometry and
  commutative algebra)).
  
  [[20X3[120X] [16XGreen, E. L.[116X, [17XNoncommutative Gr\"obner bases and projective resolutions[117X,
  in  Computational  Methods  for  Representations  of  Groups  and  Algebras,
  Birkh{\"a}user (1999), 29-60, (((Essen 1997))).
  
  [[20X4[120X]  [16XMora,  T.[116X,  [17XAn introduction to commutative and noncommutative Gr\"obner
  bases[117X, [18XTheoretical Computer Science[118X, [19X134[119X, 1 (1994), 131--173.
  
  [[20X5[120X]  [16XNavarro,  G.  and  Raffinot,  M.[116X, [17XFlexible Pattern Matching in Strings[117X,
  Cambridge University Press (2002).
  
  
  
  [32X
