Publication details

Regular Tree Algebras

Investor logo
Authors

BLUMENSATH Achim

Year of publication 2020
Type Article in Periodical
Magazine / Source Logical Methods in Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Web journal web page
Doi http://dx.doi.org/10.23638/LMCS-16(1:16)2020
Keywords infinite trees; tree algebras; regular languages; monads
Attached files
Description 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.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info