The finite graph problem for two-way alternating automata. (Q1874281): Difference between revisions

@@ Property / cites work @@
+Modal languages and bounded fragments of predicate logic
+Normal rank
@@ Property / cites work @@
+On the Restraining Power of Guards
@@ Property / cites work: On the Restraining Power of Guards / rank @@
+Normal rank
@@ Property / cites work @@
+Loosely guarded fragment of first-order logic has the finite model property
+Normal rank
@@ Property / cites work @@
+Results on the propositional \(\mu\)-calculus
@@ Property / cites work: Results on the propositional \(\mu\)-calculus / rank @@
+Normal rank
@@ Property / cites work @@
+Decidability of Second-Order Theories and Automata on Infinite Trees
+Normal rank
@@ Property / cites work @@
+Q5616162
@@ Property / cites work: Q5616162 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating tree automata
@@ Property / cites work: Alternating tree automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q4219045
@@ Property / cites work: Q4219045 / rank @@
+Normal rank
@@ Property / cites work @@
+Infinite games on finitely coloured graphs with applications to automata on infinite trees
+Normal rank