Deciding twig-definability of node selecting tree automata
From MaRDI portal
Publication:269327
DOI10.1007/s00224-015-9623-7zbMath1338.68137OpenAlexW2005933469WikidataQ59238595 ScholiaQ59238595MaRDI QIDQ269327
Timos Antonopoulos, Dag Hovland, Frank Neven, Wim Martens
Publication date: 18 April 2016
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/13962
Related Items (2)
Deciding twig-definability of node selecting tree automata ⋮ A Note on Decidable Separability by Piecewise Testable Languages
Uses Software
Cites Work
- Deciding twig-definability of node selecting tree automata
- Simplifying XML schema: single-type approximations of regular tree languages
- Structural properties of XPath fragments
- Algebras for querying text regions: Expressive power and optimization
- Query automata over finite trees
- Attribute grammars for unranked trees as a query language for structured documents
- Characterizing EF and EX tree logics
- Regular tree languages definable in FO and in FO mod
- Expressiveness of structured document query languages based on attribute grammars
- Two-variable logic on data trees and XML reasoning
- The complexity of query containment in expressive fragments of XPath 2.0
- Deciding Equivalence of Finite Tree Automata
- Tree-Walking Automata
- The complexity of XPath query evaluation and XML typing
- XPath satisfiability in the presence of DTDs
- Transitive closure logic, nested tree walking automata, and XPath
- Complexity of Decision Problems for XML Schemas and Chain Regular Expressions
- On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
- XPath evaluation in linear time
- Containment and equivalence for a fragment of XPath
- Monadic datalog and the expressive power of languages for Web information extraction
- Tree Languages Defined in First-Order Logic with One Quantifier Alternation
- Rewriting Techniques and Applications
- Normal form algorithms for extended context-free grammars
This page was built for publication: Deciding twig-definability of node selecting tree automata
