Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763)

From MaRDI portal
Revision as of 15:03, 17 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    12 January 2010
    0 references
    0 references
    decidability
    0 references