Sciweavers

656 search results - page 19 / 132
» Marrying Words and Trees
Sort
View
APPML
2010
86views more  APPML 2010»
14 years 12 months ago
A note on single-linkage equivalence
We introduce the concept of single-linkage equivalence of edge-weighted graphs, we apply it to characterise maximal spanning trees and "ultrasimilarities", and we discus...
Andreas W. M. Dress, Taoyang Wu, XiaoMing Xu
LICS
2007
IEEE
15 years 6 months ago
First-Order and Temporal Logics for Nested Words
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
Rajeev Alur, Marcelo Arenas, Pablo Barceló,...
EACL
1989
ACL Anthology
15 years 29 days ago
A logical treatment of semi-free word order and bounded discontinuous constituency
In this paper we present a logical treatment of semifree word order and bounded discontinuous constituency. We extend standard feature value logics to treat word order in a single...
Mike Reape
IPL
2008
147views more  IPL 2008»
14 years 11 months ago
Streaming tree automata
Streaming validation and querying of XML documents are often based on automata for tree-like structures. We propose a new notion of streaming tree automata in order to unify the t...
Olivier Gauwin, Joachim Niehren, Yves Roos
MFCS
2009
Springer
15 years 6 months ago
Query Automata for Nested Words
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ï...
P. Madhusudan, Mahesh Viswanathan