Nee automata and term rewrite systems (Extended abstract)

被引：0

作者：

Tison, S ^{[1
]}

机构：

[1] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France

来源：

REWRITING TECHNIQUES AND APPLICATIONS, PROCEEDINGS | 2000年 / 1833卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This tutorial is devoted to tree automata. We will present some of the most fruitful applications of tree automata in rewriting theory and we will give an outline of the current state of research on tree automata. We give here just a sketch of the presentation. The reader can also refer to the on-line book "Tree Automata and Their Applications" [CDG(+)97].

引用

页码：27 / 30

页数：4

共 27 条

[11] FLP A, 1998, LNCS, V1450, P248
[12] GECSEG F, 1996, HDB FORMAL LANGUAGES, V3, P1
[13] Genet T, 1998, LECT NOTES COMPUT SC, V1379, P151
[14] GENET T, 2000, IN PRESS CADE2000
[15] Gilleron R., 1995, Fundamenta Informaticae, V24, P157
[16] JACQUEMARD F, 1996, LNCS, V1103
[17] Jacquemard Florent, 1997, Tree automata techniques and applications
[18] TESTING FOR THE GROUND (CO-)REDUCIBILITY PROPERTY IN TERM-REWRITING SYSTEMS
KOUNALIS, E
[J]. THEORETICAL COMPUTER SCIENCE, 1992, 106 (01) : 87 - 117
[19] Limet S, 1998, LECT NOTES COMPUT SC, V1379, P121
[20] LIMET S, 1999, LNCS, V1631

← 1 2 3 →