Back to search

McMaster University

The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words

Abstract

dc:description.abstract

<p>This thesis concerns itself with drawing out some interesting connections between the fields of group theory and formal language theory. Given a group with a finite set of generators, it is natural to consider the set of generators and their inverses as an alphabet. We can then consider formal languages such that every group element has at least one representative in the language. We examine what the structure of the language can tell us about group theoretic properties, focusing on the word problem, automatic structures on groups, and generalizations of automatic structures. Finally we prove new results concerning applications of languages of nested words for studying the word problem.</p>

Degree

thesis:*
Department dc:contributor.department
Mathematics
Year dc:date.issued
2012

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Henry, Christopher S.
Advisors dc:contributor.advisor
  • Boden, Hans U.
  • Nicas, Andrew J.
  • Valeriote, Matthew

Subjects

dc:subject × 9

Identifiers

dc:identifier.*
Dc Identifier Other
opendissertations/7298
8356
3280041

Chain of custody

source
Harvested from
McMaster University
Base URL
macsphere.mcmaster.ca/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Henry, Christopher S.. The (Nested) Word Problem: Formal Languages, Group Theory, and Languages of Nested Words. 2012. http://hdl.handle.net/11375/12407