PSPACE-completeness of certain algorithmic problems on the subgroups of free groups (Q4632433)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7048681
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | PSPACE-completeness of certain algorithmic problems on the subgroups of free groups |
scientific article; zbMATH DE number 7048681 |
Statements
PSPACE-completeness of certain algorithmic problems on the subgroups of free groups (English)
0 references
29 April 2019
0 references
Turing machine
0 references
start state
0 references
finite index
0 references
finite automaton
0 references
algorithmic problem
0 references
0.9705641865730286
0 references
0.9700172543525696
0 references
0.8009064197540283
0 references
0.7833107709884644
0 references
0.7804180979728699
0 references
