License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-31404
URL:

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

pdf-format:


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.

BibTeX - Entry

@InProceedings{tison:LIPIcs:2011:3140,
  author =	{Sophie Tison},
  title =	{{Tree Automata, (Dis-)Equality Constraints and Term Rewriting: What's Newl}},
  booktitle =	{22nd International Conference on Rewriting Techniques and Applications (RTA'11)},
  pages =	{1--2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-30-9 },
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{10},
  editor =	{Manfred Schmidt-Schau{\ss}},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2011/3140},
  URN =		{urn:nbn:de:0030-drops-31404},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.RTA.2011.1},
  annote =	{Keywords: Tree Automata, Constraints, Term Rewriting}
}

Keywords: Tree Automata, Constraints, Term Rewriting
Seminar: 22nd International Conference on Rewriting Techniques and Applications (RTA'11)
Issue date: 2011
Date of publication: 2011


DROPS-Home | Fulltext Search | Imprint Published by LZI