Alternating automata, the weak monadic theory of trees and its complexity (Q1193871): Difference between revisions

@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Alternation and \(\omega\)-type Turing acceptors
@@ Property / cites work: Alternation and \(\omega\)-type Turing acceptors / rank @@
+Normal rank
@@ Property / cites work @@
+On alternating \(\omega\)-automata
@@ Property / cites work: On alternating \(\omega\)-automata / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+The theory of ends, pushdown automata, and second-order logic
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4726235
@@ Property / cites work: Q4726235 / 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 @@
+Q4134970
@@ Property / cites work: Q4134970 / rank @@
+Normal rank