Timeline for An application of ping-pong lemma
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 17, 2023 at 12:00 | history | edited | Peter LeFanu Lumsdaine | CC BY-SA 4.0 |
typo + wording
|
| May 17, 2023 at 11:56 | comment | added | ADL | I did wonder if that was what you meant! It is clearer now. | |
| May 17, 2023 at 11:51 | comment | added | Peter LeFanu Lumsdaine | @ADL: Absolutely, yes — that was what my last paragraph was aiming to say; I’ve edited it to be a little more substantial. | |
| May 17, 2023 at 11:49 | history | edited | Peter LeFanu Lumsdaine | CC BY-SA 4.0 |
elaborated on how folding algorithm lets you find this
|
| May 17, 2023 at 9:11 | comment | added | ADL | This is great! However, it seems you are taking an immersion and noting that it corresponds to the basis? A key part of Stallings' paper is his "folding" algorithm, which lets you go the other way - start with a set of words and construct an immersion. From here one can answer the question. | |
| May 16, 2023 at 14:16 | history | answered | Peter LeFanu Lumsdaine | CC BY-SA 4.0 |