Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?

Abstract : Connections between Tree Automata and Term Rewriting are now well known. Whereas tree automata can be viewed as a subclass of ground rewrite systems, tree automata are successfully used as decision tools in rewriting theory. Furthermore, applications, including rewriting theory, have influenced the definition of new classes of tree automata. In this talk, we will first present a short and not exhaustive reminder of some fruitful applications of tree automata in rewriting theory. Then, we will focus on extensions of tree automata, specially tree automata with local or/and global (dis-)equality constraints: we will emphasize new results, compare different extensions, and sketch some applications.
Type de document :
Communication dans un congrès
Manfred Schmidt-Schauss. 22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.RTA.2011.1〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00818127
Contributeur : Sophie Tison <>
Soumis le : vendredi 26 avril 2013 - 09:51:52
Dernière modification le : jeudi 21 février 2019 - 10:52:49

Identifiants

Collections

Citation

Sophie Tison. Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's New?. Manfred Schmidt-Schauss. 22nd International Conference on Rewriting Techniques and Applications (RTA'11), Apr 2011, France. Leibniz International Proceedings in Informatics (LIPIcs). 〈10.4230/LIPIcs.RTA.2011.1〉. 〈hal-00818127〉

Partager

Métriques

Consultations de la notice

204