Converting a Büchi alternating automaton to a usual nondeterministic one (Q5955787): Difference between revisions

@@ Property / cites work @@
+Alternation
@@ Property / cites work: Alternation / rank @@
+Normal rank
@@ Property / cites work @@
+Synthesis of Communicating Processes from Temporal Logic Specifications
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Alternating finite automata on \(\omega\)-words
@@ Property / cites work: Alternating finite automata on \(\omega\)-words / rank @@
+Normal rank
@@ Property / cites work @@
+Q3748266
@@ Property / cites work: Q3748266 / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating automata on infinite trees
@@ Property / cites work: Alternating automata on infinite trees / rank @@
+Normal rank
@@ Property / cites work @@
+Alternating automata, the weak monadic theory of trees and its complexity
+Normal rank
@@ Property / cites work @@
+The temporal semantics of concurrent programs
@@ Property / cites work: The temporal semantics of concurrent programs / rank @@
+Normal rank
@@ Property / cites work @@
+Temporal logic can be more expressive
@@ Property / cites work: Temporal logic can be more expressive / rank @@
+Normal rank