next up previous
Next: 10. Appendix Up: Observations on Coset Enumeration Previous: 9. Conclusions

Bibliography

1
B. Benninghofen, S. Kemmerich, and M.M. Richter.
Systems of Reductions.
LNCS 277. Springer, 1987.

2
R. Book and F. Otto.
String Rewriting Systems.
Springer, 1993.

3
D. L. Johnson.
Presentation of Groups.
Cambridge University Press, 1976.

4
N. Kuhn and K. Madlener.
A method for enumerating cosets of a group presented by a canonical system.
In G. Gonnet, editor, Proc. ISSAC'89, pages 338-350. ACM, 1989.

5
N. Kuhn, K. Madlener, and F. Otto.
Computing presentations for subgroups of polycyclic groups and of context-free groups.
Applicable Algebra in Engineering, Communication and Computing, 5:287-316, 1994.

6
G. Labonté.
An algorithm for the construction of matrix representations for finitely presented non-comutative algebras.
Journal of Symbolic Computation, 9:27-38, 1990.

7
S. Linton.
Constructing matrix representations of finitely presented groups.
Journal of Symbolic Computation, 12:427-438, 1991.

8
K. Madlener and B. Reinert.
String rewriting and Gröbner bases - a general approach to monoid and group rings.
In M. Bronstein, J. Grabmeier, and V. Weispfenning, editors, Proceedings of the Workshop on Symbolic Rewriting Techniques, Monte Verita, 1995, volume 15 of Progress in Computer Science and Applied Logic, pages 127-180. Birkhäuser, 1998.

9
R. McNaughton.
The finiteness of finitely presented monoids.
Technical report, Rensselaer Polytechnic Institute, 1997.

10
C. F. Miller.
Decision problems for groups - survey and reflections.
In Algorithms and Classification in Combinatorial Group Theory, pages 1-60. Springer, 1991.

11
J. Neubüser.
An elementary introduction to coset table methods in computational group theory.
In C. M. Campbell and E. F. Robertson, editors, Groups St. Andrews 1981, L.M.S. Lecture Notes 71, pages 1-45. Cambridge University Press, 1982.

12
B. H. Neumann.
Some remarks on semigroup presentations.
Canadian Journal of Mathematics, 19:1018-1026, 1967.

13
B. Reinert.
On Gröbner Bases in Monoid and Group Rings.
PhD thesis, Universität Kaiserslautern, 1995.

14
B. Reinert, T. Mora, and K. Madlener.
A note on nielsen reduction and coset enumeration.
In O. Gloor, editor, Proc. ISSAC'98, pages 171-178. ACM, 1998.

15
C. Sims.
Computation with Finitely Presented Groups.
Cambridge University Press, 1994.



| ZCA Home | Reports |