Regular Tree Algebras

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.

Authors

• Achim Blumensath

Keywords

No keywords are indexed for this paper.