54 search results - page 2 / 11 » Deterministic Automata on Unranked Trees |
ICALP
2005
Springer
14 years 26 days ago
2005
Springer
Labeled unranked trees are used as a model of XML documents, and logical languages for them have been studied actively over the past several years. Such logics have different purpo...
ICDT
2012
ACM
11 years 9 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
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...
DBPL
2005
Springer
14 years 26 days ago
2005
Springer
ICALP
2004
Springer
14 years 22 days ago
2004
Springer
Tree-walking automata are a natural sequential model for recognizing languages of finite trees. Such automata walk around the tree and may decide in the end to accept it. It is s...