Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763): Difference between revisions
From MaRDI portal
Latest revision as of 10:13, 30 July 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
0 references