next up previous
Next: About this document ... Up: Relating Rewriting Techniques on Previous: 7. Concluding Remarks


J. Avenhaus and D. Wißmann. Using Rewriting Techniques to Solve the Generalized Word Problem in Polycyclic Groups. Proc. ISSAC'89. pp 322-337.

B. Buchberger. Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. Dissertation. Universität Innsbruck. 1965.

B. Buchberger. A Critical-Pair Completion Algorithm for Finitely Generated Ideals in Rings. Proc. Logic and Machines: Decision Problems and Complexity. Springer LNCS 171(1983). pp 137-161.

R. Book and F. Otto. String Rewriting Systems. Springer Verlag. 1993.

R. Cremanns. Finiteness Conditions for Rewriting Systems. Dissertation. Kassel. 1995.

R. Cremanns and F. Otto. Constructing Canonical Presentations for Subgroups of Context-Free Groups in Polynomial Time. Proc. ISSAC'94.

R. Gilman. Presentations of Groups and Monoids. Journal of Algebra 57(1979). pp 544-554.

G. Huet. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems. Journal of the ACM 27(4)(1980). pp 797-821.

G. Huet. A Complete Proof of Correctness of the Knuth-Bendix Completion Algorithm. Journal of Computer and System Science 23(1)(1981). pp 11-21.

M. Jantzen. On a Special Monoid with Single Defining Relation. Theoretical Computer Science 16(1981). pp 61-73.

M. Jantzen. A Note on a Special One-rule Semi-Thue System. Information Processing Letters 21(1985). pp 135-140.

D.L. Johnson. Presentation of Groups. London Mathematical Society Lecture Note Series 22. Cambridge University Press. 1976.

A. Kandri-Rody, D. Kapur and F. Winkler. Knuth-Bendix Procedure and Buchberger Algorithm - a Synthesis. Proc. ISSAC'89. pp 55-67.

D. Kapur and K. Madlener. A Completion Procedure for Computing a Canonical Basis for a k-Subalgebra. Computers and Mathematics. Springer Verlag. 1989. pp 1-11.

D. Kapur and P. Narendran. A Finite Thue System with Decidable Word Problem and Without Equivalent Finite Canonical System. Theoretical Computer Science 35(1985). pp 337-344.

A. Kandri-Rody and V. Weispfenning. Non-Commutative Gröbner Bases in Algebras of Solvable Type. Journal of Symbolic Computation 9(1990). pp 1-26.

D. Knuth and P. Bendix. Simple Word Problems in Universal Algebras. J. Leech (editor). Computaional Problems in Abstract Algebra. Pergamon Press. Oxford. 1970. pp 263-297.

N. Kuhn. Zur Entscheidbarkeit des Untergruppenproblems für Gruppen mit kanonischen Darstellungen. Dissertation. Universität Kaiserslautern. 1991.

N. Kuhn and K. Madlener. A Method for Enumerating Cosets of a Group Presented by a Canonical System. Proc. ISSAC'89. pp 338-350.

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(1994). pp 287-316.

G. Lallement. Semigroups and Combinatorial Applications. John Wiley & Sons. New York. 1979.

R. C. Lyndon and P. E. Schupp. Combinatorial Group Theory. Springer Verlag(1977).

K. Madlener and F. Otto. About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. Theoretical Computer Science 67(1989). pp 143-172.

K. Madlener and F. Otto. Some Undecidability Results for Finitely Generated Thue Congruences on a Two-Letter Alphabet. E. Schock (ed.). Beiträge zur Angewandten Analysis und Informatik, Helmut Brakhage zu Ehren. Verlag Shaker. Aachen. 1994. pp 248-261.

K. Madlener and B. Reinert. Computing Gröbner Bases in Monoid and Group Rings. Proc. ISSAC'93. pp 254-263.

K. Madlener and B. Reinert. String Rewriting and Gröbner Bases - A General Approach to Monoid and Group Rings. Proceedings of the Workshop on Symbolic Rewriting Techniques. Monte Verita. 1995. (to appear)

K. Madlener and B. Reinert. A Generalization of Gröbner Basis Algorithms to Polycyclic Group Rings. Journal of Symbolic Computation. (to appear)

K. Madlener and B. Reinert. A Generalization of Gröbner Bases Algorithms to Nilpotent Group Rings. Applicable Algebra in Engineering, Communication and Computing Vol. 8 No. 2(1997). pp 103-123.

W. Magnus, A. Karrass and D. Solitar. Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Dover Publications. New York. 1976.

S. Margolis, J. Meakin and M. Sapir. Algorithmic Problems in Groups, Semigroups and Inverse Monoids. Semigroups, Formal Languages and Groups. J. Fountain (ed). Kluwer Academic Press. 1993. pp 147-214.

C.F. Miller. Decision Problems for Groups - Survey and Reflections. Algorithms and Classification in Combinatorial Group Theory. G. Baumslag, C.F. Miller (eds.). Springer Verlag. 1991. pp 1-60.

J.L. Miller. Analogs of Gröbner Bases in Polynomial Rings over a Ring. Journal of Symbolic Computation 21(1996). pp 139-153.

F. Mora. Gröbner Bases for Non-Commutative Polynomial Rings. Proc. AAECC-3(1985). Springer LNCS 229. pp 353-362.

T. Mora. Gröbner Bases and the Word Problem. Working Paper. 1987.

T. Mora. An Introduction to Commutative and Non-Commutative Gröbner Bases. Theoretical Computer Science 134(1994). pp 131-173.

J. Nielsen. Om Regning med ikke kommutative Faktoren og dens Anvendelse i Gruppeteorien. Mat. Tidsskr. B.(1921). pp 77-94.

C. Ó'Dúnlaing. Undecidable Questions Related to Church-Rosser Thue Systems. Theoretical Computer Science 23(1983). pp 339-345.

B. Reinert. Gröbner Bases in Monoid and Group Rings. Dissertation. Universität Kaiserslautern. 1995.

B. Reinert. Introducing Reduction to Polycyclic Group Rings - A Comparison of Methods. Reports on Computer Algebra No 9. Centre of Computer Algebra. Universität Kaiserslautern. 1996.

L. Robbiano and M. Sweedler. Subalgebra Bases. Proc. Commutative Algebra Salavador. W. Burns, A. Simis (eds.). Springer LNM 1430. 1990. pp 61-87.

A. Sattler-Klein. A Systematic Study of Infinite Canonical Systems generated by Knuth-Bendix Completion and Related Problems. Dissertation. Universität Kaiserslautern. 1996.

D. Shannon and M. Sweedler. Using Gröbner Bases to Determine Algebra Membership, Split Surjective Algebra Homomorphisms Determine Birational Equivalence. Journal of Symbolic Computation 6(1988). pp 267-273.

C. Sims. Computation with finitely presented groups. Cambridge University Press 1994.

C. Squier. Word Problems and a Homological Finiteness Condition for Monoids. Journal of Pure Applied Algebra 49(1987). pp 201-217.

D. Wißmann. Anwendung von Rewriting-Techniken in polyzyklischen Gruppen. Dissertation. Universität Kaiserslautern. 1989.

| ZCA Home | Reports |