The pro-\(p\) topology of a free group and algorithmic problems in semigroups. (English) Zbl 0839.20041
An algorithm is exhibited to decide whether or not a finitely generated subgroup of a free group \(F\) is closed in the pro-\(p\)-group topology on \(F\).
Reviewer: Yu.N.Mukhin (Ekaterinburg)
MSC:
| 20E18 | Limits, profinite groups |
| 20F10 | Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) |
| 20E07 | Subgroup theorems; subgroup growth |
| 20M05 | Free semigroups, generators and relations, word problems |
| 20E05 | Free nonabelian groups |
