139
click to vote
PLANX
15 years 2 months ago
2008 
Macro forest transducers (mfts) extend macro tree transducers (mtts) from ranked to unranked trees. Mfts are more powerful than mtts (operating on binary tree encodings) because t...
PLANX
15 years 2 months ago
2008 
We present an initial attempt at providing a formal specification for a mini
108
click to vote
PLANX
15 years 2 months ago
2008
Regular Expressions (REs) form the basis of most XML type languages, such as DTDs, XML Schema types, and XDuce types (Thompson et al. 2004; Hosoya and Pierce 2003). In this contex...
108
click to vote
PLANX
15 years 2 months ago
2008
We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
|
Programming Languages