October 17, 2019
1:50PM - 2:50PM
Mathematics Building 317
Add to Calendar
2019-10-17 13:50:00
2019-10-17 14:50:00
Geometric Group Theory Seminar - Michal Ferov
Title: Linguistic complexity of primitive sets in free groups
Speaker: Michal Ferov - The University of Newcastle
Abstract: A set of elements of a free group is said to be primitive if it can be extended to a free base. In my talk I will sketch a proof that, as a formal language, the set of primitive sets of a free group is context sensitive. Time permitting, I will discuss that in the case of the free group on two generators the linguistic complexity of primitives can be brought down to EDT0L. No background in former languages is assumed - I will give all the necessary definitions.
Mathematics Building 317
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2019-10-17 13:50:00
2019-10-17 14:50:00
Geometric Group Theory Seminar - Michal Ferov
Title: Linguistic complexity of primitive sets in free groups
Speaker: Michal Ferov - The University of Newcastle
Abstract: A set of elements of a free group is said to be primitive if it can be extended to a free base. In my talk I will sketch a proof that, as a formal language, the set of primitive sets of a free group is context sensitive. Time permitting, I will discuss that in the case of the free group on two generators the linguistic complexity of primitives can be brought down to EDT0L. No background in former languages is assumed - I will give all the necessary definitions.
Mathematics Building 317
Department of Mathematics
math@osu.edu
America/New_York
public
Title: Linguistic complexity of primitive sets in free groups
Speaker: Michal Ferov - The University of Newcastle
Abstract: A set of elements of a free group is said to be primitive if it can be extended to a free base. In my talk I will sketch a proof that, as a formal language, the set of primitive sets of a free group is context sensitive. Time permitting, I will discuss that in the case of the free group on two generators the linguistic complexity of primitives can be brought down to EDT0L. No background in former languages is assumed - I will give all the necessary definitions.
