WQO is decidable for factorial languages (Q2407108)
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 6782892
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | WQO is decidable for factorial languages |
scientific article; zbMATH DE number 6782892 |
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
0.975574553012848
0 references
0.7848250269889832
0 references
0.7524836659431458
0 references
0.7386746406555176
0 references
0.7385615110397339
0 references
