252 search results - page 5 / 51 » Automata for Data Words and Data Trees |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
ADBIS
2004
Springer
14 years 28 days ago
2004
Springer
Abstract. We propose a descriptive high-level language XDTrans devoted to specify transformations over XML data. The language is based on unranked tree automata approach. In contra...
ITP
2010
13 years 11 months ago
2010
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
COLING
2008
13 years 9 months ago
2008
We propose a supervised word sense disambiguation (WSD) method using tree-structured conditional random fields (TCRFs). By applying TCRFs to a sentence described as a dependency t...
LPAR
2010
Springer
13 years 5 months ago
2010
Springer
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...