Deciding reachability problems in Turing-complete fragments of Mobile Ambients (Q3655763): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation congruences in safe ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A calculus of mobile processes. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational strength of pure ambient calculi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anytime, anywhere / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal molecular biology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Reachability and Spatial Reachability in Fragments of BioAmbients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of movement and restriction in pure mobile ambients / rank
 
Normal rank
Property / cites work
 
Property / cites work: When ambients cannot be opened / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Analysis in BioAmbients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: BioAmbients: an abstraction for biological compartments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5590814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive unsolvability of Post's problem of ''Tag'' und other topics in theory of Turing machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistence of vector replacement systems is decidable / rank
 
Normal rank

Revision as of 09:25, 2 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
    0 references
    0 references
    12 January 2010
    0 references
    0 references
    decidability
    0 references