WQO is decidable for factorial languages (Q2407108)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | WQO is decidable for factorial languages |
scientific article |
Statements
WQO is decidable for factorial languages (English)
0 references
28 September 2017
0 references
well-quasi-ordering
0 references
factorial language
0 references
polynomial-time algorithm
0 references
induced subgraph
0 references
permutation
0 references
