46 search results - page 5 / 10 » Isomorphism of regular trees and words |
FUIN
2010
13 years 6 months ago
2010
An infinite binary word can be identified with a branch in the full binary tree. We consider sets of branches definable in monadic second-order logic over the tree, where we allow ...
MFCS
2009
Springer
14 years 3 months ago
2009
Springer
We study visibly pushdown automata (VPA) models for expressing and evaluating queries, expressed using MSO formulas, on words with a nesting structure (like XML documents). We de�...
CIKM
2008
Springer
13 years 10 months ago
2008
Springer
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
PODS
2005
ACM
14 years 8 months ago
2005
ACM
We consider here the exchange of Active XML (AXML) data, i.e., XML documents where some of the data is given explicitly while other parts are given only intensionally as calls to ...
DAM
2010
13 years 8 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...