The following pages link to Automata for XML -- a survey (Q878749):
Displayed 29 items.
- Highly expressive query languages for unordered data trees (Q269323) (← links)
- XML compression via directed acyclic graphs (Q269349) (← links)
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Evolving schemas for streaming XML (Q638517) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Rewriting of visibly pushdown languages for XML data integration (Q719268) (← links)
- Constant-time tree traversal and subtree equality check for grammar-compressed trees (Q724220) (← links)
- Synchronizing relations on words (Q905682) (← links)
- Reasoning about XML with temporal logics and automata (Q975873) (← links)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- On characterization of fuzzy tree pushdown automata (Q2001163) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Lattice-valued tree pushdown automata: pumping lemma and closure properties (Q2076992) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Leafy automata for higher-order concurrency (Q2233404) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- Regular expressions for data words (Q2353403) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Parameterized complexity of basic decision problems for tree automata (Q2855747) (← links)
- State Complexity of Kleene-Star Operations on Trees (Q2891328) (← links)
- Learning Tree Languages (Q2963598) (← links)
- Tree Automata with Global Constraints (Q3533021) (← links)
- TREE AUTOMATA WITH GLOBAL CONSTRAINTS (Q3586405) (← links)
- Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
- (Q5091269) (← links)
- (Q5092332) (← links)
- State Trade-Offs in Unranked Tree Automata (Q5200097) (← links)
- (Q5875342) (← links)
- On-the-fly bisimilarity checking for fresh-register automata (Q6168987) (← links)