141 search results - page 20 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
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�...
PODS
2004
ACM
14 years 8 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
POPL
2010
ACM
14 years 6 months ago
2010
ACM
Traditional parser generation technologies are incapable of handling the demands of modern programmers. In this paper, we present the design and theory of a new parsing engine, YA...
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
DOCENG
2003
ACM
14 years 1 months ago
2003
ACM
By exploiting the theories of automata and graphs, we propose algorithms and a process for editing valid XML documents [4][5]. The editing process avoids syntactic violations alto...