The Generation Problem in Thompson Group $F$ LN While one group consisted of

While one group consisted of academics and artists known for their humour and eccentricity and the other were a group of deadly serious architects emerging to international proliference

He tells us: "The phenomenon of death sets in like this: In the moment of death

you will not be able to put it down

with a focus on integrating the National Health Education Standards

In a sequence of verse letters he addresses the poets of the First World War directly

The Generation Problem in Thompson Group $F$ LN While one group consisted ofWe show that the generation problem in Thompson's group F is decidable, i. e., there is an algorithm which decides if a finite set of elements of F generates the whole F. The algorithm makes use of the Stallings 2 core of subgroups of F, which can be defined in an analogous way to the Stallings core of subgroups of a finitely generated free group. Further study of the Stallings 2 core of subgroups of F provides a solution to another algorithmic