Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics

被引：5
|
作者：
Droste, Manfred [1 ]
Heusel, Doreen [1 ]
Vogler, Heiko [2 ]
机构：
[1] Univ Leipzig, Inst Informat, D-04109 Leipzig, Germany
[2] Tech Univ Dresden, Inst Theoret Informat, D-01062 Dresden, Germany
来源：
ALGEBRAIC INFORMATICS (CAI 2015) | 2015年 / 9270卷
关键词：
D O I：
10.1007/978-3-319-23021-4_9
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We introduce a new behavior of weighted unranked tree automata. We prove a characterization of this behavior by two fragments of weighted MSO logic and thereby provide a solution of an open equivalence problem of Droste and Vogler. The characterization works for valuation monoids as weight structures; they include all semirings and, in addition, enable us to cope with average.
引用
收藏
页码：90 / 102
页数：13
相关论文
共 50 条
12345