Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
type: Item
instance of: scholarly article
title: Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra
zbMATH Open document ID: 0873.68135
DOI: 10.1016/0304-3975(94)00214-4
author: David E. Muller
author: Paul E. Schupp
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 985758
zbMATH Keywords: nondeterministic tree automata
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)00214-4
OpenAlex ID: W2076284895
cites work: Q5525343
cites work: Q4143272
cites work: Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
cites work: Q3995303
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Infinite games played on finite graphs
cites work: Alternating automata on infinite trees
cites work: FINITE STATE PROCESSES, Z-TEMPORAL LOGIC AND THE MONADIC THEORY OF THE INTEGERS
cites work: Decidability of Second-Order Theories and Automata on Infinite Trees
cites work: Q5616162
cites work: Q4074888
cites work: Q3819052
cites work: Propositional dynamic logic of looping and converse is elementarily decidable
cites work: Q3214824
cites work: Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies
cites work: Gurevich-Harrington's games defined by finite automata
cites work: Unforgettable Forgetful Determinacy
description: scientific article; zbMATH DE number 985758