AUTOMATA AND TREE AUTOMATA AS (F-1, F-2)-COALGEBRAS

被引：0
作者：
Denecke, Klaus [1 ]
机构：
[1] Univ Potsdam, Inst Mathemat, Am Neuen Palais 10, D-14469 Potsdam, Germany
来源：
ASIAN-EUROPEAN JOURNAL OF MATHEMATICS | 2009年 / 2卷 / 01期
关键词：
Automaton; tree automaton; coalgebra; coalgebra homomorphism;
D O I：
10.1142/S1793557109000054
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
This paper extends existing relationships between automata and F-coalgebras to relationships between tree automata and (F-1, F-2)-coalgebras. The concept of an (F-1, F-2)-coalgebra generalizes that of an F-coalgebra as well as that of an F-algebra. The paper sketches some of the most important properties of the category Set((F1, F2)) of (F1, F2)-coalgebras.
引用
收藏
页码：57 / 69
页数：13
相关论文
共 23 条
[1]  
Aczel P., 1988, NONWELL FOUNDED SETS
[2]  
Adamek J., 2001, ELECT NOTES TEORETIC, V44
[3]  
Adamek J., 1990, ABSTRACT CONCRETE CA
[4]  
Brinkmann H. B., 1966, LECT NOTES MATH, V18
[5]  
Burris S., 1981, COURSE UNIVERSAL ALG
[6]  
Denecke K., 2008, STATE BASED SYSTEMS
[7]  
DRBOHLAV K, 1971, ACTA FAC RERUM NAT U, P17
[8]  
Gecseg Ferenc, 1997, HDB FORMAL LANGUAGES, V3, p[1, 910], DOI DOI 10.1007/978-3-642-59126-6_1
[9]  
Gumm H. P., 2003, ALLGEMEINE ALGEBRA
[10]  
Gumm H. P., 1999, LECT NOTES LU ATCS 9
123