Abstract
Various problems involving rational subsets of finitely generated free groups can be solved efficiently using a technique related to coset enumeration. We investigate the extension of this method to other finitely generated groups.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Anisimov, Languages over free groups, Springer Lecture Notes in Computer Science 32 1975, 167–171.
A.V. Anisimov, to appear.
R.V. Book, The power of the Church-Rosser property for string rewriting systems, 6th Conf. on Automated Deduction, New York, 1982, Springer Lecture Notes in Computer Science 138 1982, 360–368.
R.V. Book, M. Jantzen and C. Wrathall, Monadic Thue systems, Theor. Comp. Sci. 19 1982, 231–251.
H. Bucken, Anwendung von Reduktionssysteme auf das Wort-problem in der Gruppentheorie, Dissertation, Aachen 1979.
S. Eilenberg and M.P. Schutzenberger, Rational sets in commutative monoids, J. Alg. 13 1969, 173–191.
R. Gilman, Presentations of groups and monoids, J. Alg. 57 1979, 544–554.
P. Johansen, Free groups and regular expressions, ACM Symposium on Theory of Computing, May 5–7, 1969, Marina del Rey, CA., 113–128.
D.E. Knuth and P.B. Bendix, Simple word problems in universal algebras, in "Computational Problems in Abstract Algebra", J. Leech ed., Pergamon Pr., Oxford 1970, 263–297.
R.C. Lyndon and P.E. Schupp, "Combinatorial Group Theory", Springer Verlag, Berlin 1977.
K.A. Mihailova, The occurrence problem for direct products of groups, Mat. Sb. (N.S.) 70 (112) 1966, 241–251.
D.E. Muller and P.E. Schupp, Context-free languages, groups, the theory of ends, second order logic, tiling problems, cellular automata, and vector addition systems, Bull. A.M.S. (N.S.) 4 1981, 331–334.
C. Sims, Lecture given at Symposium on Computational Group Theory, Durham 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gilman, R.H. (1984). Computations with rational subsets of confluent groups. In: Fitch, J. (eds) EUROSAM 84. EUROSAM 1984. Lecture Notes in Computer Science, vol 174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032843
Download citation
DOI: https://doi.org/10.1007/BFb0032843
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13350-6
Online ISBN: 978-3-540-38893-7
eBook Packages: Springer Book Archive