Skip to main content Accessibility help
×
Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-03T00:20:02.150Z Has data issue: false hasContentIssue false

Irreducible word problems in groups

Published online by Cambridge University Press:  07 May 2010

Ana R. Fonseca
Affiliation:
Department of Computer Science, University of Leicester, Leicester LE1 7RH, England
Duncan W. Parkes
Affiliation:
Department of Computer Science, University of Leicester, Leicester LE1 7RH, England
Richard M. Thomas
Affiliation:
Department of Computer Science, University of Leicester, Leicester LE1 7RH, England
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
G. C. Smith
Affiliation:
University of Bath
Get access

Summary

Abstract

In this paper we consider irreducible word problems in groups. In particular, we look at results concerning groups whose irreducible word problem lies in some given class of languages (such as the class of finite languages or the class of context-free languages).

Introduction

In this paper we look at irreducible word problems in groups; see Section 4 below for the definition. We are particularly interested in connections with formal language theory; to be more specific, we consider which types of group can have their irreducible word problem lying in some given class of languages (such as the class of finite languages or the class of context-free languages).

We summarize what we need from formal language theory in Section 2. The general question of the connection between irreducible word problems and classes of languages follows on from the analogous question concerning the links between word problems and classes of languages, and we look at some relevant information in Section 3. We come to reduced and irreducible word problems in Section 4, and we talk there about groups with a finite irreducible word problem. We mention some general results about irreducible word problems and languages in Section 5, and then, in Section 6, concentrate on groups whose irreducible word problem is context-free. We finish with some further comments in Section 7.

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

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 [email protected] 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
×