Branch-Continuous Tree Algebras

2018/07/12 by Blumensath, Achim
#FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL)

paper · doi:10.48550/arxiv.1807.04568

Abstract

We study a class of algebras that can be used as recognisers for regular languages of infinite trees.

Related

• Proving that a Tree Language is not First-Order Definable
• An infinite branch in a decidable tree
• Tree languages and branched groups
• ω-Forest Algebras and Temporal Logics
• Tree algebras and bisimulation-invariant MSO on finite graphs