Groups and Simple Languages

With any finitely generated presentation (pi) = of a group G, one can associate a formal language WP(,0)((pi)), the reduced word problem of (pi), consisting of all words on the generators and their inverses which are equal to the identity of G but have no proper prefix equal to the identity. A general problem, then, is to determine what the nature of the reduced word problem implies about the structure of the group G, or, conversely, how the properties of G affect WP(,0)((pi)).

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Mathematics

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2014

Author dc:creator

• Haring-Smith, Robert Henry

• Mathematics

Language dc:language

eng

Identifier

(UMI)AAI8203480

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/68190