Sciweavers

Share
CSL
2006
Springer

Automata and Logics for Words and Trees over an Infinite Alphabet

8 years 6 months ago
Automata and Logics for Words and Trees over an Infinite Alphabet
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of semistructured data, timed automata and extended temporal logics. This paper survey several know results on automata and logics manipulating data words and data trees, the focus being on their relative expressive power and decidability.
Luc Segoufin
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CSL
Authors Luc Segoufin
Comments (0)
books