Computing presentations for subgroups of context-free groups

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Computing presentations for subgroups of context-free groups

Full text

Pdf (920 KB)

Source

International Conference on Symbolic and Algebraic Computation archive
Papers from the international symposium on Symbolic and algebraic computation table of contents

Berkeley, California, United States

Pages: 240 - 250

Year of Publication: 1992

ISBN:0-89791-489-9

Authors

Norbert Kuhn
Klaus Madlener
Friedrich Otto

Sponsors

SIGSAM: ACM Special Interest Group on Symbolic and Algebraic Manipulation
SIGNUM: ACM Special Interest Group on Numerical Mathematics

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 12, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/143242.143321 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Jean-Michel Autebert , Luc Boasson , Geraud Sénizergues, Groups and NTS languages, Journal of Computer and System Sciences, v.35 n.2, p.243-267, Oct. 1987 [doi>10.1016/0022-0000(87)90015-8]
	2	J. Avenhaus, K. Madlener; On groups defined by monadic Thue systems; in: Algebra, Combinatorics and Logic in Computer Science, Colloq. Math. Soc. Janos Bolyai 42 (GySr, 1983) 63-71.
	3	G. Bauer; Zur Darstellung yon Monoiden dutch konfluente Reduktionssysteme, Doctoral dissertation (Fachbereich Informatik, Universit~t Kaiserslautern, 1981).
	4	R.V. Book; Decidable sentences of Church- Rosser congruences; Theoretical Computer Science 23 (1983) 301-312.
	5	Y. Cochet; Church-Rosser congruences on free semigroups; in: Algebraic Theory of Semigroups, Colloq. Math. Soc. Janos Bolyai 20 (North-Holland, Amsterdam, 1976) 51-60.
	6	Robert H. Gilman, Computations with Rational Subsets of Confluent Groups, Proceedings of the International Symposium on Symbolic and Algebraic Computation, p.207-212, July 09-11, 1984
	7	N. Kuhn; Zur Entscheidbarkeit des Untergruppenproblems fiir Gruppen mit kanoT~ischen Darstellungen, Doctoral dissertation (Fachbereich informatik, Universit~t Kaiserslautern, 1991).
	8	N. Kuhn , K. Madlener, A method for enumerating cosets of a group presented by a canonical system, Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation, p.338-350, July 17-19, 1989, Portland, Oregon, United States [doi>10.1145/74540.74580]
	9	N. Kuhn , K. Madlener , F. Otto, A test for λ-confluence for certain prefix rewriting systems with applications to the generalized word problem, Proceedings of the international symposium on Symbolic and algebraic computation, p.8-15, August 20-24, 1990, Tokyo, Japan [doi>10.1145/96877.96882]
	10	K. Madlener , P. Narendran , F. Otto, A specialized completion procedure for monadic string-rewriting systems presenting groups, Proceedings of the 18th international colloquium on Automata, languages and programming, p.279-290, June 1991, Madrid, Spain
	11	K. Madlener, P. Narendran, F. Otto, L. Zhang; On weakly confluent monadic stringrewriting systems; Preprint No. 11/91 (Fachbereich Mathematik/Informatik, Gesamthochschule Kassel, 1991); also: submitted for publication.
	12	K. Madlener , F. Otto, About the descriptive power of certain classes of finite string-rewriting systems, Theoretical Computer Science, v.67 n.2-3, p.143-172, Oct. 1989 [doi>10.1016/0304-3975(89)90002-9]
	13	K. Madlener , F. Otto, Decidable sentences for context-free groups, Proceedings of the 8th annual symposium on Theoretical aspects of computer science, p.160-171, February 1991, Hamburg, Germany
	14	W. Magnus, A. Karrass, D. Solitar; Combinatorial Group Theory (Wiley-interscience, New York, 1966).
	15	D.E. Muller, P.E. Schupp; Groups, the theory of ends and context-free languages; Journal Computer System Sciences 26 (1983) 295- 310.
	16	F Otto, On deciding whether a monoid is a free monoid or is a group, Acta Informatica, v.23 n.1, p.99-110, April 1986 [doi>10.1007/BF00268077]
	17	Friedrich Otto, Some Undecidability Results for Weakly Confluent Monadic String-Rewriting Systems, Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.292-303, October 07-11, 1991