LIPIcs.RTA.2010.1.pdf
- Filesize: 70 kB
- 4 pages
Document
Automata for Data Words and Data Trees
Author
-
Part of:
Volume:
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2010-07-06
Cite As Get 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)
https://doi.org/10.4230/LIPIcs.RTA.2010.1
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.
Subject Classification
Keywords
- Automata
- Data Word
- Data Tree
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads