Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 

 

Groups and simple languages


Author: Robert H. Haring-Smith
Journal: Trans. Amer. Math. Soc. 279 (1983), 337-356
MSC: Primary 20F10; Secondary 05C25, 20E06, 68Q45
DOI: https://doi.org/10.1090/S0002-9947-1983-0704619-4
MathSciNet review: 704619
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: With any finitely generated group presentation, one can associate a formal language (called the reduced word problem) consisting of those words on the generators and their inverses which are equal to the identity but which have no proper prefix equal to the identity. We show that the reduced word problem is a simple language if and only if each vertex of the presentation's Cayley diagram has only a finite number of simple closed paths passing through it. Furthermore, if the reduced word problem is simple, then the group is a free product of a free group of finite rank and a finite number of finite groups.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Transactions of the American Mathematical Society with MSC: 20F10, 05C25, 20E06, 68Q45

Retrieve articles in all journals with MSC: 20F10, 05C25, 20E06, 68Q45


Additional Information

DOI: https://doi.org/10.1090/S0002-9947-1983-0704619-4
Keywords: Word problem for groups, free product of groups, context-free language, simple language, Cayley diagram, partial group
Article copyright: © Copyright 1983 American Mathematical Society