An algebraic proof of Rabin's Tree Theorem

Authors:
Achim Blumensath
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2013

Citing 3
Cited 0

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

Theoretical Computer Science
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Recognisability for algebras of infinite trees

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

We continue the development of a theory of recognisability for infinite trees by introducing the equivalent of a Wilke algebra. As an application we give a new proof of the decidability of the monadic second-order theory of the infinite binary tree, a proof that does not use automata or games.