Rajeev Alur, Pavol Cerný & Scott Weinstein (2009):
Algorithmic Analysis of Array-Accessing Programs.
In: CSL'09, LNCS 5771,
pp. 86–101,
doi:10.1007/978-3-642-04027-6_9.
Also available as a technical report, http://repository.upenn.edu/cis_reports/894/.
Henrik Björklund & Mikłoj Bojanczyk (2007):
Bounded depth data trees.
In: In ICALP' 07,
pp. 862–874,
doi:10.1007/978-3-540-73420-8_74.
Mikołaj Bojańczyk & Sławomir Lasota (2010):
An extension of data automata that captures XPath.
In: LICS '10,
pp. 243–252,
doi:10.1109/LICS.2010.33.
Mikołaj Bojanczyk, Anca Muscholl, Thomas Schwentick, Luc Segoufin & Claire David (2006):
Two-Variable Logic on Words with Data.
In: LICS '06,
pp. 7–16,
doi:10.1109/LICS.2006.51.
K. Reinhardt (2005):
Counting as Method, Model and Task in Theoretical Computer Science.
Habilitation thesis.
Universität Tübingen.
Luc Segoufin (2006):
Automata and Logics for Words and Trees over an Infinite Alphabet.
In: CSL, LNCS 4207,
pp. 41–57,
doi:10.1007/11874683_3.
Zhilin Wu (2011):
A decidable extension of data automata.
Manuscript, avialable at http://lcs.ios.ac.cn/ wuzl/wu-gandalf11.pdf.