Abstract
Algorithms for solving uniform decision problems for algebraic structures crucially depend on the chosen finite presentations for the structures under consideration. Rewriting techniques have been used very successfully to solve uniform decision problems, when the presentations considered involve finite, noetherian, and (λ)-confluent rewriting systems. Whenever the class of algebraic structures considered is closed under the operation of taking finitely generated substructures, then the algorithms for solving the uniform decision problems can be applied to the substructures as well. However, since these algorithms depend on the form of the presentations, this involves the task of constructing a presentation of a certain form for a substructure given a presentation of this form for the structure itself and a finite set of generating elements for the substructure.
This problem, which has received a lot of attention in algebra, is here investigated from an algorithmic point of view. The structures considered are the following two classes of groups, which have been studied extensively before: the polycyclic groups and the context-free groups.
Finitely generated context-free groups can be presented by finite, monadic, and λ-confluent string-rewriting systems. Due to their nice algorithmic properties these systems provide a way to effectively solve many decision problems for context-free groups. Since finitely generated subgroups of context-free groups are again contextfree, they can be presented in the same way. Here we describe a process that, from a finite, monadic, and λ-confluent string-rewriting system presenting a context-free groupG and a finite subsetU ofG, determines a presentation of this form for the subgroup 〈U〉 ofG that is generated byU. For finitely presented polycyclic groups we obtain an analogous result, when we use finite confluent PCP2-presentations to describe these groups.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Autebert, J., Boasson, L., Senizergues, G.: Groups and NTS languages. J. Comput. Sys. Sci.35, 243–267 (1987)
Avenhaus, J., Madlener, K.: On groups defined by monadic Thue systems. In: Algebra, Combinatorics and Logic in Computer Science. Colloq. Math. Soc. Janos Bolyai42, 63–71 (Györ, 1983)
Avenhaus, J., Wißmann, D.: Using rewriting techniques to solve the generalized word problem in polycyclic groups. In: Gonnet, G. (ed.) Proceedings ISSAC'89 (ACM, New York, 1989) pp. 322–337
Bauer, G.: Zur Darstellung von Monoiden durch konfluente Reduktionssysteme, Doctoral dissertation (Fachbereich Informatik, Universität Kaiserslautern 1981)
Baumslag, G., Cannonito, F. B., Miller, C. F. III: Infinitely generated subgroups of finitely presented groups I. Math. Z.153, 117–134 (1977)
Baumslag, G., Cannonito, F. B., Robinson, D. J. S., Segal, D.: The algorithmic theory of polycyclic-by-finite groups. J. Algebra142, 118–149 (1991)
Book, R. V.: Decidable sentences of Church-Rosser congruences. Theoret. Comput. Sci.23, 301–312 (1983)
Book, R. V., Jantzen, M., Wrathall, C.: Monadic Thue systems. Theoret. Comput. Sci.19, 231–251 (1982)
Cochet, Y.: Church-Rosser congruences on free semigroups. In: Algebraic Theory of Semigroups. Colloq. Math. Soc. Janos Bolyai vol.20, pp. 51–60. Amsterdam: North-Holland 1976
Gilman, R. H.: Computations with rational subsets of confluent groups. In: Fitch, J. (ed.). Proceedings EUROSAM 84. Lecture Notes in Computer Science, vol.174, pp. 207–212. Berlin, Heidelberg, New York: Springer 1984
Kuhn, N.: Zur Entscheidbarkeit des Untergruppenproblems für Gruppen mit kanonischen Darstellungen. Doctoral dissertation (Fachbereich Informatik, Universität Kaiserslautern 1991)
Kuhn, N., Madlener, K.: A method for enumerating cosets of a group presented by a canonical system. In: Gonnet, G. (ed.). Proceedings ISSAC'89, pp. 338–350 (ACM, New York 1989)
Kuhn, N., Madlener, K., Otto, F.: A test for λ-confluence for certain prefix rewriting systems with applications to the generalized word problem. In: Watanabe, S., Nagata, M. (eds.). Proceedings ISSAC'90, pp. 8–15 (ACM, New York 1990)
Lyndon, R., Schupp, P.: Combinatorial Group Theory. Berlin, Heidelberg, New York: Springer 1977
Madlener, K., Narendran, P., Otto, F.: A specialized completion procedure for monadic string-rewriting systems presenting groups. In: Albert, J. L., Monien, B., Artalejo, M. R. (eds.). Proceedings 18th ICALP. Lecture Notes in Computer Science vol.510, pp. 279–290. Berlin, Heidelberg, New York: Springer 1991
Madlener, K., Narendran, P., Otto, F., Zhang, L.: On weakly confluent monadic stringrewriting systems: Theoret. Comput. Sci.113, 119–165 (1993)
Madlener, K., Otto, F.: About the descriptive power of certain classes of finite string-rewriting systems: Theoret. Comput. Sci.67, 143–172 (1989)
Madlener, K., Otto, F.: Decidable sentences for context-free groups. In: Choffrut, C., Jantzen, M. (eds.). Proceedings STACS'91. Lecture Notes in Computer Science. vol 480, pp. 160–171. Berlin, Heidelberg, New York: Springer 1991
Magnus, W., Karrass, A., Solitar, D.: Combinatorial Group Theory. New York: Wiley-Interscience 1966
Miller, C. F. III: On group-theoretic decision problems and their classification. Ann. Math. Studies vol.68. Princeton: Princeton University Press 1971
Muller, D. E., Schupp, P. E.: Groups, the theory of ends and context-free languages. J. Comput. Syst. Sci.26, 295–310 (1983)
Otto, F.: On deciding whether a monoid is a free monoid or is a group. Acta Informatica23, 99–110 (1986)
Otto, F.: Some undecidability results for weakly confluent monadic string-rewriting systems. In: Mattson, H. F., Mora, T., Rao, T. R. N. (eds.). Proceedings AAECC-9. Lecture Notes in Computer Science vol. 539, pp. 292–303. Berlin, Heidelberg, New York: Springer 1991
Robinson, D. J. S.: Reflections on the constructive theory of polycyclic groups. In: Lecture Notes in Mathematics vol. 1398, pp. 163–169. Berlin, Heidelberg, New York: Springer 1989
Segal, D.: Decidable properties of polycyclic groups. Proc. Lond. Math. Soc. (3)61, 497–528 (1990)
Wißmann, D.: Anwendung von Rewriting-Techniken in polyzyklischen Gruppen. Doctoral dissertation (Fachbereich Informatik, Universität Kaiserslautern 1989)
Author information
Authors and Affiliations
Additional information
This work was performed while this author was visiting at the Fachbereich Informatik, Universität Kaiserslautern, during his sabbatical 1991/92
Rights and permissions
About this article
Cite this article
Kuhn, N., Madlener, K. & Otto, F. Computing presentations for subgroups of polycyclic groups and of context-free groups. AAECC 5, 287–316 (1994). https://doi.org/10.1007/BF01225643
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01225643