Positive tree representations and applications to tree automata

被引：3
|
作者：
Bozapalidis, S [1 ]
机构：
[1] Aristotelian Univ Salonika, Dept Math, GR-54006 Salonika, Greece
来源：
INFORMATION AND COMPUTATION | 1997年 / 139卷 / 02期
关键词：
D O I：
10.1006/inco.1997.2667
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An effective classification of tree automata costed over the semirings R+ and N (and more generally of positive tree representations (PTR)) is achieved by means of a global behavior theory. Reducibility and minimality of PTRs is also investigated. (C) 1997 Academic Press.
引用
收藏
页码：130 / 153
页数：24
相关论文
共 50 条
12345