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. Finally, we give a more algebraic characterisation of the algebras in our class.

Bibliographic Details
Main Author: Achim Blumensath
Format: Article
Language:English
Published: Logical Methods in Computer Science e.V. 2020-02-01
Series:Logical Methods in Computer Science
Subjects:
Online Access:https://lmcs.episciences.org/4747/pdf
_version_ 1827322767707471872
author Achim Blumensath
author_facet Achim Blumensath
author_sort Achim Blumensath
collection DOAJ
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.
first_indexed 2024-04-25T01:34:07Z
format Article
id doaj.art-0e0183a7b0624bd799c115961073e205
institution Directory Open Access Journal
issn 1860-5974
language English
last_indexed 2024-04-25T01:34:07Z
publishDate 2020-02-01
publisher Logical Methods in Computer Science e.V.
record_format Article
series Logical Methods in Computer Science
spelling doaj.art-0e0183a7b0624bd799c115961073e2052024-03-08T10:29:27ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742020-02-01Volume 16, Issue 110.23638/LMCS-16(1:16)20204747Regular Tree AlgebrasAchim BlumensathWe 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.https://lmcs.episciences.org/4747/pdfcomputer science - formal languages and automata theory
spellingShingle Achim Blumensath
Regular Tree Algebras
Logical Methods in Computer Science
computer science - formal languages and automata theory
title Regular Tree Algebras
title_full Regular Tree Algebras
title_fullStr Regular Tree Algebras
title_full_unstemmed Regular Tree Algebras
title_short Regular Tree Algebras
title_sort regular tree algebras
topic computer science - formal languages and automata theory
url https://lmcs.episciences.org/4747/pdf
work_keys_str_mv AT achimblumensath regulartreealgebras