REGULAR TREE ALGEBRAS

被引：3
|
作者：
Blumensath, Achim [1 ]
机构：
[1] Masaryk Univ Brno, Brno, Czech Republic
来源：
LOGICAL METHODS IN COMPUTER SCIENCE | 2020年 / 16卷 / 01期
关键词：
infinite trees; tree algebras; regular languages; monads;
D O I：
10.23638/LMCS-16(1:16)2020
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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.
引用
收藏
页数：25
相关论文
共 50 条
12345