43 search results - page 4 / 9 » Minimizing Tree Automata for Unranked Trees |
FSTTCS
2006
Springer
13 years 11 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
MFCS
2009
Springer
14 years 1 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ļ...
LICS
2005
IEEE
14 years 28 days ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
PPDP
2010
Springer
13 years 5 months ago
2010
Springer
We propose a model for XML update primitives of the W3C XQuery Update Facility as parameterized rewriting rules of the form: "insert an unranked tree from a regular tree lang...
IJFCS
2007
13 years 7 months ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable reļ¬nement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...