Skip to main content Accessibility help
×
Hostname: page-component-788cddb947-jbkpb Total loading time: 0 Render date: 2024-10-12T10:00:13.713Z Has data issue: false hasContentIssue false

Formal languages and group theory

Published online by Cambridge University Press:  05 September 2015

Sam A.M. Jones
Affiliation:
University of Leicester
Richard M. Thomas
Affiliation:
University of Leicester
C. M. Campbell
Affiliation:
University of St Andrews, Scotland
M. R. Quick
Affiliation:
University of St Andrews, Scotland
E. F. Robertson
Affiliation:
University of St Andrews, Scotland
C. M. Roney-Dougal
Affiliation:
University of St Andrews, Scotland
Get access

Summary

Introduction

Our aim is to explore some connections between word problems of groups and formal language theory. One question is whether any finitely presented group has a recursive word problem, i.e., if there is an algorithm to decide if a given word in the generators of such a group represents the identity; this was shown not to be the case by Novikov and Boone independently [37, 6]. A finitely presented group has a recursively enumerable word problem however, i.e., there is a process listing the words representing the identity; the process will not terminate (there are infinitely many such words) but any word representing the identity will eventually appear.

We are interested in relating the complexity of the word problem (as a formal language) to the algebraic structure of the group. With regards to the classes of languages we have just mentioned, there is the beautiful Higman embedding theorem [16] which says that a finitely generated group has a recursively enumerable word problem if and only if it can be embedded in a finitely presented group. For recursive languages it was shown by Boone and Higman [7] that a finitely generated group has a recursive word problem if and only if it can be embedded in a simple group which can, in turn, be embedded in a finitely presented group. This was strengthened by Thompson [44] who showed that a finitely generated group has a recursive word problem if and only if it can be embedded in a finitely generated simple group which can, in turn, be embedded in a finitely presented group. There is a natural (and seemingly difficult) question (attributed to Higman) which asks if we can strengthen this further by proving that every finitely generated group with a recursive word problem can be embedded in a finitely presented simple group.

We will survey some work concerning groups whose word problem is a simpler type of language. We will concentrate on the class of context-free languages, some subclasses of the context-free languages and some other related classes (such as intersections and complements of context-free languages); there are many other interesting classes of languages we have not discussed such as the the class of real-time languages (see [18, 20, 23] for example) the class of growing context-sensitive languages (see [22, 29]) and the class of context-sensitive languages (see [31, 41]).

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2015

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×