Regular Tree Algebras

Abstract

We introduce a class of algebras that can be used as recognisers for regular tree languages. We show that it is the only such class that forms a pseudo-variety and we prove the existence of syntactic algebras. Finally, we give a more algebraic characterisation of the algebras in our class.

References in corpus (2)

• Recognisable languages over monads
• A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra