Reachability on prefix-recognizable graphs (Q975403): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2008.04.008
+Normal rank
@@ Property / OpenAlex ID @@
+W2108144184
@@ Property / OpenAlex ID: W2108144184 / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability analysis of pushdown automata: Application to model-checking
+Normal rank
@@ Property / cites work @@
+Finite presentations of infinite structures: Automata and interpretations
+Normal rank
@@ Property / cites work @@
+Q2842876
@@ Property / cites work: Q2842876 / rank @@
+Normal rank
@@ Property / cites work @@
+On infinite transition graphs having a decidable monadic theory
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems
+Normal rank
@@ Property / cites work @@
+A note on emptiness for alternating finite automata with a one-letter alphabet
+Normal rank
@@ Property / cites work @@
+First-order and counting theories of<i>ω</i>-automatic structures
+Normal rank
@@ Property / cites work @@
+Prefix-Recognizable Graphs and Monadic Logic
@@ Property / cites work: Prefix-Recognizable Graphs and Monadic Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Reachability problems on regular ground tree rewriting graphs
+Normal rank
@@ Property / cites work @@
+Foundations of Software Science and Computation Structures
+Normal rank
@@ Property / cites work @@
+Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains
+Normal rank