Deciding twig-definability of node selecting tree automata
From MaRDI portal
Recommendations
Cites work
- Algebras for querying text regions: Expressive power and optimization
- Attribute grammars for unranked trees as a query language for structured documents
- Characterizing EF and EX tree logics
- Complexity of decision problems for XML schemas and chain regular expressions
- Containment and equivalence for a fragment of XPath
- Deciding Equivalence of Finite Tree Automata
- Deciding twig-definability of node selecting tree automata
- Expressiveness of structured document query languages based on attribute grammars
- Monadic Datalog and the expressive power of languages for web information extraction
- Normal form algorithms for extended context-free grammars
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- Query automata over finite trees
- Regular tree languages definable in FO and in FO\(_{\mathrm{mod}}\)
- Rewriting Techniques and Applications
- Simplifying XML schema: single-type approximations of regular tree languages
- Structural properties of XPath fragments
- The complexity of XPath query evaluation and XML typing
- The complexity of query containment in expressive fragments of XPath 2.0
- Transitive closure logic, nested tree walking automata, and XPath
- Tree-Walking Automata
- Two-variable logic on data trees and XML reasoning
- XPath evaluation in linear time
- XPath satisfiability in the presence of DTDs
Cited in
(2)
This page was built for publication: Deciding twig-definability of node selecting tree automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q269327)
