Reachability analysis of fragments of mobile ambients in AC term rewriting (Q939167): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00165-008-0081-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2075788396
@@ Property / OpenAlex ID: W2075788396 / rank @@
+Normal rank
@@ Property / cites work @@
+When ambients cannot be opened
@@ Property / cites work: When ambients cannot be opened / rank @@
+Normal rank
@@ Property / cites work @@
+Programming Languages and Systems
@@ Property / cites work: Programming Languages and Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Computer Science
@@ Property / cites work: Theoretical Computer Science / rank @@
+Normal rank
@@ Property / cites work @@
+Mobile ambients
@@ Property / cites work: Mobile ambients / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability Analysis of Mobile Ambients in Fragments of AC Term Rewriting
+Normal rank
@@ Property / cites work @@
+On the computational strength of pure ambient calculi
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+Process rewrite systems.
@@ Property / cites work: Process rewrite systems. / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic tree pushdown automata and monadic tree rewriting systems
+Normal rank