License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2010.1
URN: urn:nbn:de:0030-drops-26397
Go to the corresponding LIPIcs Volume Portal

Bojanczyk, Mikolaj

Automata for Data Words and Data Trees

10002.BojanczykMikolaj.2639.pdf (0.07 MB)


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

  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 =		{},
  URN =		{urn:nbn:de:0030-drops-26397},
  doi =		{10.4230/LIPIcs.RTA.2010.1},
  annote =	{Keywords: Automata, Data Word, Data Tree}

Keywords: Automata, Data Word, Data Tree
Collection: 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 | Privacy Published by LZI