On decidability and complexity of low-dimensional robot games (Q2009641)
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: On decidability and complexity of low-dimensional robot games |
scientific article; zbMATH DE number 7138697
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On decidability and complexity of low-dimensional robot games |
scientific article; zbMATH DE number 7138697 |
Statements
On decidability and complexity of low-dimensional robot games (English)
0 references
29 November 2019
0 references
reachability games
0 references
vector addition game
0 references
decidability
0 references
winning strategy
0 references
integer vector addition system
0 references
0 references
0.9252489
0 references
0.9075502
0 references
0 references
0.8596398
0 references
0.8529968
0 references
0.84457666
0 references
0.8350129
0 references
0.8230658
0 references
