Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355)
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: Algorithmic analysis of programs with well quasi-ordered domains. |
scientific article; zbMATH DE number 1853112
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithmic analysis of programs with well quasi-ordered domains. |
scientific article; zbMATH DE number 1853112 |
Statements
Algorithmic analysis of programs with well quasi-ordered domains. (English)
0 references
14 January 2003
0 references
decidability
0 references
well-structured systems
0 references
0.8367617726325989
0 references
0.824440598487854
0 references
0.812528133392334
0 references
0.8048366904258728
0 references
0.8048366904258728
0 references
