Bisimulation equivalence and regularity for real-time one-counter automata (Q2637644): Difference between revisions

@@ Property / cites work @@
+Q2760238
@@ Property / cites work: Q2760238 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
+Normal rank
@@ Property / cites work @@
+Counting on CTL\(^*\): On the expressive power of monadic path logic
+Normal rank
@@ Property / cites work @@
+Deciding bisimilarity is P-complete
@@ Property / cites work: Deciding bisimilarity is P-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Process rewrite systems.
@@ Property / cites work: Process rewrite systems. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4665738
@@ Property / cites work: Q4665738 / rank @@
+Normal rank
@@ Property / cites work @@
+The Bisimulation Problem for Equational Graphs of Finite Out-Degree
+Normal rank
@@ Property / cites work @@
+Bisimilarity of Pushdown Automata is Nonelementary
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? decidability results from complete formal systems
+Normal rank
@@ Property / cites work @@
+\(L(A)=L(B)\)? A simplified decidability proof.
@@ Property / cites work: \(L(A)=L(B)\)? A simplified decidability proof. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737211
@@ Property / cites work: Q4737211 / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of DPDA Language Equivalence via First-Order Grammars
+Normal rank
@@ Property / cites work @@
+Q4449197
@@ Property / cites work: Q4449197 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial algorithm for deciding bisimilarity of normed context-free processes
+Normal rank
@@ Property / cites work @@
+Q2908855
@@ Property / cites work: Q2908855 / rank @@
+Normal rank
@@ Property / cites work @@
+The inclusion problem for simple languages
@@ Property / cites work: The inclusion problem for simple languages / rank @@
+Normal rank
@@ Property / cites work @@
+An elementary bisimulation decision procedure for arbitrary context-free processes
+Normal rank
@@ Property / cites work @@
+Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
+Normal rank
@@ Property / cites work @@
+BPA bisimilarity is EXPTIME-hard
@@ Property / cites work: BPA bisimilarity is EXPTIME-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of bisimilarity for one-counter processes.
+Normal rank
@@ Property / cites work @@
+Beyond Language Equivalence on Visibly Pushdown Automata
+Normal rank
@@ Property / cites work @@
+Foundations of Software Science and Computation Structures
+Normal rank
@@ Property / cites work @@
+Deterministic one-counter automata
@@ Property / cites work: Deterministic one-counter automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4737202
@@ Property / cites work: Q4737202 / rank @@
+Normal rank
@@ Property / cites work @@
+Simulation Over One-counter Nets is PSPACE-Complete
+Normal rank
@@ Property / cites work @@
+Q5417673
@@ Property / cites work: Q5417673 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability in Succinct and Parametric One-Counter Automata
+Normal rank
@@ Property / cites work @@
+When Model-Checking Freeze LTL over Counter Machines Becomes Decidable
+Normal rank
@@ Property / cites work @@
+Model Checking FO(R) over One-Counter Processes and beyond
+Normal rank
@@ Property / cites work @@
+Branching-time model checking of one-counter processes
+Normal rank
@@ Property / cites work @@
+Equivalence of deterministic one-counter automata is NL-complete
+Normal rank
@@ Property / cites work @@
+Semigroups, Presburger formulas, and languages
@@ Property / cites work: Semigroups, Presburger formulas, and languages / rank @@
+Normal rank