On an algorithm to decide whether a free group is a free factor of another (Q3515469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On an algorithm to decide whether a free group is a free factor of another |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On an algorithm to decide whether a free group is a free factor of another |
scientific article |
Statements
On an algorithm to decide whether a free group is a free factor of another (English)
0 references
29 July 2008
0 references
free groups
0 references
free factor groups
0 references
inverse automata
0 references
algorithms
0 references
finitely generated subgroups
0 references
lengths of generators
0 references
ranks
0 references
0 references
0.7979323267936707
0 references
0.7909216284751892
0 references
0.786372184753418
0 references
0.7848570346832275
0 references
0.7829244136810303
0 references
