Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (Q673778): Difference between revisions

Latest revision as of 10:27, 27 May 2024

scientific article

Language	Label	Description	Also known as
English	Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra	scientific article

Statements

instance of

scholarly article

0 references

title

Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra (English)

0 references

0 references

0 references

Theoretical Computer Science

0 references

publication date

28 February 1997

0 references

zbMATH Keywords

nondeterministic tree automata

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0304-3975(94)00214-4

0 references

cites work

Q5525343

0 references

Q4143272

0 references

Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages

0 references

Q3995303

0 references

Testing and generating infinite sequences by a finite automaton

0 references

Infinite games played on finite graphs

0 references

Alternating automata on infinite trees

0 references

FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS

0 references

Decidability of Second-Order Theories and Automata on Infinite Trees

0 references

Q5616162

0 references

Q4074888

0 references

Q3819052

0 references

Propositional dynamic logic of looping and converse is elementarily decidable

0 references

Q3214824

0 references

Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies

0 references

Gurevich-Harrington's games defined by finite automata

0 references

Unforgettable Forgetful Determinacy

0 references

Identifiers

zbMATH Open document ID

0873.68135

0 references

DOI

10.1016/0304-3975(94)00214-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:673778

@@ Property / cites work @@
+Q5525343
@@ Property / cites work: Q5525343 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4143272
@@ Property / cites work: Q4143272 / rank @@
+Normal rank
@@ Property / cites work @@
+Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
+Normal rank
@@ Property / cites work @@
+Q3995303
@@ Property / cites work: Q3995303 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+Infinite games played on finite graphs
@@ Property / cites work: Infinite games played on finite graphs / 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 @@
+FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
+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 @@
+Q4074888
@@ Property / cites work: Q4074888 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3819052
@@ Property / cites work: Q3819052 / rank @@
+Normal rank
@@ Property / cites work @@
+Propositional dynamic logic of looping and converse is elementarily decidable
+Normal rank
@@ Property / cites work @@
+Q3214824
@@ Property / cites work: Q3214824 / rank @@
+Normal rank
@@ Property / cites work @@
+Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
+Normal rank
@@ Property / cites work @@
+Gurevich-Harrington's games defined by finite automata
+Normal rank
@@ Property / cites work @@
+Unforgettable Forgetful Determinacy
@@ Property / cites work: Unforgettable Forgetful Determinacy / rank @@
+Normal rank