Context-free commutative grammars with integer counters and resets (Q2636518): Difference between revisions

@@ Property / describes a project that uses @@
+Easychair
@@ Property / describes a project that uses: Easychair / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964313388
@@ Property / OpenAlex ID: W2964313388 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.04893
@@ Property / arXiv ID: 1511.04893 / rank @@
+Normal rank
@@ Property / cites work @@
+Reasoning about systems with many processes
@@ Property / cites work: Reasoning about systems with many processes / rank @@
+Normal rank
@@ Property / cites work @@
+The covering and boundedness problems for vector addition systems
+Normal rank
@@ Property / cites work @@
+An Algorithm for the General Petri Net Reachability Problem
+Normal rank
@@ Property / cites work @@
+A structure to decide reachability in Petri nets
@@ Property / cites work: A structure to decide reachability in Petri nets / rank @@
+Normal rank
@@ Property / cites work @@
+Demystifying Reachability in Vector Addition Systems
+Normal rank
@@ Property / cites work @@
+The equality problem for vector addition systems is undecidable
+Normal rank
@@ Property / cites work @@
+Nonprimitive recursive complexity and undecidability for Petri net equivalences
+Normal rank
@@ Property / cites work @@
+Q4219024
@@ Property / cites work: Q4219024 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Register Machines with Polynomial Updates
+Normal rank
@@ Property / cites work @@
+Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets
+Normal rank
@@ Property / cites work @@
+The complexity of equivalence problems for commutative grammars
+Normal rank
@@ Property / cites work @@
+On reachability equivalence for BPP-nets
@@ Property / cites work: On reachability equivalence for BPP-nets / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity Results for Problems of Communication-Free Petri Nets and Related Formalisms
+Normal rank
@@ Property / cites work @@
+On the reachability problem for 5-dimensional vector addition systems
+Normal rank
@@ Property / cites work @@
+Commutative grammars: The complexity of uniform word problems
+Normal rank
@@ Property / cites work @@
+Q4727433
@@ Property / cites work: Q4727433 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4353915
@@ Property / cites work: Q4353915 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Problems of Commutative Grammars
@@ Property / cites work: Complexity of Problems of Commutative Grammars / rank @@
+Normal rank
@@ Property / cites work @@
+Q4601893
@@ Property / cites work: Q4601893 / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Vector Addition Systems with States
@@ Property / cites work: Integer Vector Addition Systems with States / rank @@
+Normal rank
@@ Property / cites work @@
+Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities
+Normal rank
@@ Property / cites work @@
+Q4941166
@@ Property / cites work: Q4941166 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Automated Deduction – CADE-20
@@ Property / cites work: Automated Deduction – CADE-20 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Succinct and Parametric One-Counter Automata
+Normal rank
@@ Property / cites work @@
+Complexity Analysis of Continuous Petri Nets
@@ Property / cites work: Complexity Analysis of Continuous Petri Nets / rank @@
+Normal rank
@@ Property / cites work @@
+Q3914461
@@ Property / cites work: Q3914461 / rank @@
+Normal rank
@@ Property / cites work @@
+Remarks on blind and partially blind one-way multicounter machines
+Normal rank
@@ Property / cites work @@
+Q4737916
@@ Property / cites work: Q4737916 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequential grammars and automata with valences
@@ Property / cites work: Sequential grammars and automata with valences / rank @@
+Normal rank
@@ Property / cites work @@
+Semilinearity and Context-Freeness of Languages Accepted by Valence Automata
+Normal rank
@@ Property / cites work @@
+Bounds on Positive Integral Solutions of Linear Diophantine Equations
+Normal rank
@@ Property / cites work @@
+Dominoes and the complexity of subclasses of logical theories
+Normal rank
@@ Property / cites work @@
+Subclasses of presburger arithmetic and the weak EXP hierarchy
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of pattern matching for highly compressed two-dimensional texts.
+Normal rank
@@ Property / cites work @@
+Unary Pushdown Automata and Straight-Line Programs
+Normal rank
@@ Property / cites work @@
+The taming of the semi-linear set
@@ Property / cites work: The taming of the semi-linear set / rank @@
+Normal rank
@@ Property / cites work @@
+Approaching the coverability problem continuously
@@ Property / cites work: Approaching the coverability problem continuously / rank @@
+Normal rank
@@ Property / cites work @@
+Mathematical foundations of computer science 2013. 38th international symposium, MFCS 2013, Klosterneuburg, Austria, August 26--30, 2013. Proceedings
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2636518