The complexity of finding SUBSEQ\((A)\) (Q839630)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of finding SUBSEQ\((A)\) |
scientific article |
Statements
The complexity of finding SUBSEQ\((A)\) (English)
0 references
2 September 2009
0 references
automaton
0 references
automata theory
0 references
context-free language
0 references
context-free grammar
0 references
computability
0 references
turing degree
0 references
computational complexity
0 references
Higman's lemma
0 references
subsequence
0 references
bounded queries
0 references
unbounded search
0 references
recursive mathematics
0 references
reverse mathematics
0 references
0 references
0 references
0 references
