252 search results - page 4 / 51 » Automata for Data Words and Data Trees |
LICS
2012
IEEE
11 years 8 months ago
2012
IEEE
—Data trees are trees in which each node, besides carrying a label from a finite alphabet, also carries a data value infinite domain. They have been used as an abstraction mode...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
MFCS
2009
Springer
14 years 9 days ago
2009
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from an infinite domain. Over data words we consider the logic LTL↓ 1(F), th...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
LICS
2006
IEEE
13 years 11 months ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...