Sciweavers

Share
FOIKS
2008
Springer

Visibly Pushdown Transducers for Approximate Validation of Streaming XML

8 years 5 months ago
Visibly Pushdown Transducers for Approximate Validation of Streaming XML
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent to Extended Document Type Definitions (EDTDs), and thus, they provide means for elegantly solving various problems on XML. Especially, it has been shown that VPAs are the apt device for streaming XML. One of the important problems about XML that can be addressed using VPAs is the validation problem in which we need to decide whether an XML document conforms to the specification given by an EDTD. In this paper, we are interested in solving the approximate version of this problem, which is to decide whether an XML document can be modified by a tolerable number of edit operations to yield a valid one with respect to a given EDTD. For this, we define Visibly Pushdown Transducers (VPTs) that give us the framework for solving this problem under two different semantics for edit operations on XML. While the first sem...
Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
Related Content
Added 26 Oct 2010
Updated 26 Oct 2010
Type Conference
Year 2008
Where FOIKS
Authors Alex Thomo, Srinivasan Venkatesh, Ying Ying Ye
Comments (0)
books