License
when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2010.1
URN: urn:nbn:de:0030-drops-26397
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2639/
Bojanczyk, Mikolaj

Automata for Data Words and Data Trees

pdf-format:
Dokument 1.pdf (70 KB)

Abstract

Data words and data trees appear in verification and XML processing. The term ``data'' means that positions of the word, or tree, are decorated with elements of an infinite set of data values, such as natural numbers or ASCII strings. This talk is a survey of the various automaton models that have been developed for data words and data trees.

BibTeX - Entry

@InProceedings{bojanczyk:LIPIcs:2010:2639,
  author =	{Mikolaj Bojanczyk},
  title =	{Automata for Data Words and Data Trees},
  booktitle =	{Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
  pages =	{1--4},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-18-7},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{6},
  editor =	{Christopher Lynch},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2639},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.RTA.2010.1},
  annote =	{Keywords: Automata, Data Word, Data Tree}
}

Keywords: Automata, Data Word, Data Tree
Seminar: Proceedings of the 21st International Conference on Rewriting Techniques and Applications
Issue date: 2010
Date of publication: 06.07.2010

DROPS-Home | Fulltext Search | Imprint Published by LZI