Applying rewriting techniques to groups with power-commutation-presentations

  • Dieter Wissmann
Computational Logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)


In this paper we apply rewriting techniques to certain types of string-rewriting systems related to power-commutation-presentations for finitely generated (f.g.) abelian groups, f.g. nilpotent groups, f.g. supersolvable groups and f.g. polycyclic groups. We develop a modified version of the Knuth-Bendix completion procedure which transforms such a string-rewriting system into an equivalent canonical system of the same type. This completion procedure terminates on all admissible inputs and works with a fixed reduction ordering on strings. Since canonical string-rewriting systems have decidable word problem this procedure shows that the systems above have uniformly decidable word problem. In addition, this result yields a new purely combinatorial proof for the well-known uniform decidability of the word problem for the corresponding groups.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Ballantyne, Lankford 81]
    Ballantyne A.M., Lankford D., New decision algorithms for finitely presented commutative semigroups; Math. and computations with applications, 159–165 (1981).Google Scholar
  2. [Boone 55]
    Boone W.W., Certain simple unsolvable problems of group theory; Indag. Math. 16, 231–237, 492–497 (1954); 17, 252–256, 571–577 (1955).Google Scholar
  3. [Hall 59]
    Hall M., The theory of groups; The Macmillan Company (1959).Google Scholar
  4. [Huet 81]
    Huet G., A complete proof of the correctness of the Knuth-Bendix comletion algorithm; J. Computer System Science 23,1, 11–21, (1981).Google Scholar
  5. [Jürgensen 70]
    Jürgensen H., Calculation with the elements of a finite group given by generators and defining relations; In: (Leech J., Ed.) Computational Problems in AbstractAlgebra; 47–57 (1970), Oxford: Pergamon Press.Google Scholar
  6. [Kandri-Rody et al 85]
    Kandri-Rody A., Kapur D., Narendran P., An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras; Proc.Intern. Conf. on Rewriting Techniques and Applications, Dijon, 345–365 (1985), Springer-Verlag LNCS 202.Google Scholar
  7. [Kapur, Narendran 85]
    Kapur D., Narendran P., The Knuth-Bendix completin procedure and Thue-systems; SIAM Jornal of computation, vol. 14, no. 4, 1052–1070 (1985).Google Scholar
  8. [Knuth,Bendix 70]
    Knuth D. und Bendix P., Simple word problems in universal algebras; In: (Leech J., Ed.) Computoblems in Abstract Algebra; 263–297 (1970), Oxford: Pergamon Press.Google Scholar
  9. [Laue,Neubüser,Schoenwaelder 84]
    Laue R., Neubüser J. und Schoenwaelder U., Algorithms for Finite Soluble Groups and the SOGOS System; In: Computational Group Theory (Ed. Atkinson M.D.), Academic Press, 105–135 (1984).Google Scholar
  10. [Le Chenadec 86]
    Le Chenadec P., Canonical Forms in Finitely Presented Algebras; Research Notes in Theoretical Computer Science; Pitman, London 1986.Google Scholar
  11. [Lindenberg 62]
    Lindenberg W., Über eine Darstellung von Gruppenelementen in digitalen Rechenautomaten; Numerische Mathematik 4, 151–153 (1962).Google Scholar
  12. [Madlener, Otto 87]
    Madlener K., Otto F., Groups presented by certain Classes of Finite Length-Reducing string Rewriting Systems; Proc.Intern. Conf. on Rewriting Techniques and Applications, Bordeaux, 133–144 (1987), Springer LNCS 256.Google Scholar
  13. [Neubüser 61]
    Neubüser J., Bestimmung der Untergruppenverbände endlicher p-Gruppen auf einer programmgesteuerten elektronischen Dualmaschine; Numerische Mathematik 3, 271–278 (1961).Google Scholar
  14. [Newman 42]
    Newman M.H.A., On theories with a combinatorial definition of equivalence; Ann. of Math. 43, 223–243 (1942).Google Scholar
  15. [Newman 76]
    Newman M.F., Calculating presentations for certain kinds of quotient groups; In SYMSAC 76, Proc. of the 1976 ACM Symposium on Symbolic and Algebraic Computation (Ed. Jenks R.D.), 2–8, Assoc. Comput. Mach., (New York 1976).Google Scholar
  16. [Novikov 55]
    Novikov P.S., On the algorithmic unsolvability of the word problem in group theory; Trudy Mat. Inst. Steklov, 44, 143 (1955).Google Scholar
  17. [Post 47]
    Post E., Recursive unsolvability of aproblem of Thue; J.Symb. Log. 12, 1–11 (1947).Google Scholar
  18. [Sims 87]
    Sims C.C., Verifying nilpotence; J. Symbolic Computation 3, 231–247 (1987).Google Scholar
  19. [Wamsley 74]
    Wamsley J.W., Computation in nilpotent groups (theory); Proc.Second Internat. Conf. Theory of Groups (Canberra, 1973), Lecture Notes in Mathematics, Vol. 372, 691–700, Springer-Verlag, Berlin.Google Scholar
  20. [Winkler, Buchberger 83]
    Winkler F. und Buchberger B., A criterion for eliminating unnecessary reductions in the Knuth-Bendix Algorithm; Colloquium on Algebra, Combinatorics and Logic in Computer Science (Györ, Ungarn, 12.–16. Sept 1983).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Dieter Wissmann
    • 1
  1. 1.Department of Computer ScienceUniversity of KaiserslauternKaiserslauternFRG

Personalised recommendations