Logical Methods in Computer Science (Feb 2020)

Regular Tree Algebras

  • Achim Blumensath

DOI
https://doi.org/10.23638/lmcs-16(1:16)2020
Journal volume & issue
Vol. Volume 16, Issue 1

Abstract

Read online

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.

Keywords