Automata for Data Words and Data Trees

Author Mikolaj Bojanczyk

Thumbnail PDF


  • Filesize: 70 kB
  • 4 pages

Document Identifiers

Author Details

Mikolaj Bojanczyk

Cite AsGet BibTex

Mikolaj Bojanczyk. Automata for Data Words and Data Trees. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)


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.
  • Automata
  • Data Word
  • Data Tree


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads