You are here: TUCS > PUBLICATIONS > Publication Search > Tree Automata in the Theory of...
Tree Automata in the Theory of Term Rewriting
Magnus Steinby, Tree Automata in the Theory of Term Rewriting. In: Words, Languages and Combinatorics III, 434-449, World Scientific, 2003.
Abstract:
In this paper we survey several applications of tree automata and regular tree languages in term rewriting theory.
Also some recently introduced types of tree automata by which the range of such applications can be extended
beyond the linear case are considered.
BibTeX entry:
@INPROCEEDINGS{inpSteinby03a,
title = {Tree Automata in the Theory of Term Rewriting},
booktitle = {Words, Languages and Combinatorics III},
author = {Steinby, Magnus},
publisher = {World Scientific},
pages = {434-449},
year = {2003},
keywords = {tree automata, tree languages, term rewriting},
}
Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics