An algebraic proof of Rabin's tree theorem

DOI10.1016/J.TCS.2013.01.026zbMath1283.68222OpenAlexW2010933307MaRDI QIDQ1951555

Achim Blumensath

Publication date: 6 June 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2013.01.026

zbMATH Keywords

monadic second-order logicrecognizabilityinfinite treesalgebraic theory of languagesRabin's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25)

Related Items (7)

Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Typing Weak MSOL Properties ⋮ Monoidal-closed categories of tree automata ⋮ Unnamed Item ⋮ Algebra for trees

This page was built for publication: An algebraic proof of Rabin's tree theorem