Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:30, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deciding reachability problems in Turing-complete fragments of Mobile Ambients |
scientific article |
Statements
Deciding reachability problems in Turing-complete fragments of Mobile Ambients (English)
0 references
12 January 2010
0 references
decidability
0 references
