Deciding twig-definability of node selecting tree automata

Authors:
Timos Antonopoulos;Dag Hovland;Wim Martens;Frank Neven
Affiliations:
Hasselt University and Transnational University of Limburg;University of Oslo;Universität Bayreuth;Hasselt University and Transnational University of Limburg
Venue:
Proceedings of the 15th International Conference on Database Theory
Year:
2012

Citing 28
Cited 0

Deciding equivalence of finite tree automata

SIAM Journal on Computing
Languages, automata, and logic

Handbook of formal languages, vol. 3
Algebras for querying text regions: expressive power and optimization

Journal of Computer and System Sciences - Fourteenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Expressive and efficient pattern languages for tree-structured data (extended abstract)

PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars

Journal of the ACM (JACM)
Query automata over finite trees

Theoretical Computer Science
Automata theory for XML researchers

ACM SIGMOD Record
Query Evaluation on Compressed Trees (Extended Abstract)

LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Containment and equivalence for a fragment of XPath

Journal of the ACM (JACM)
Monadic datalog and the expressive power of languages for Web information extraction

Journal of the ACM (JACM)
XPath query containment

ACM SIGMOD Record
The complexity of XPath query evaluation and XML typing

Journal of the ACM (JACM)
Attribute grammars for unranked trees as a query language for structured documents

Journal of Computer and System Sciences
Efficient algorithms for processing XPath queries

ACM Transactions on Database Systems (TODS)
Looping Caterpillars

LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Structural properties of XPath fragments

Theoretical Computer Science - Database theory
Conditional XPath

ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Characterizing EF and EX tree logics

Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Expressiveness and complexity of XML Schema

ACM Transactions on Database Systems (TODS)
XPath satisfiability in the presence of DTDs

Journal of the ACM (JACM)
XPath leashed

ACM Computing Surveys (CSUR)
Two-variable logic on data trees and XML reasoning

Journal of the ACM (JACM)
The complexity of query containment in expressive fragments of XPath 2.0

Journal of the ACM (JACM)
Regular tree languages definable in FO and in FOmod

ACM Transactions on Computational Logic (TOCL)
Transitive closure logic, nested tree walking automata, and XPath

Journal of the ACM (JACM)
Simplifying XML schema: single-type approximations of regular tree languages

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Deciding Definability in FO_2(

LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
XPath evaluation in linear time

Journal of the ACM (JACM)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Node selecting tree automata (NSTAs) constitute a general formalism defining unary queries over trees. Basically, a node is selected by an NSTA when it is visited in a selecting state during an accepting run. We consider twig patterns as an abstraction of XPath. Since the queries definable by NSTAs form a strict superset of twig-definable queries, we study the complexity of the problem to decide whether the query by a given NSTA is twig-definable. In particular, we obtain that the latter problem is EXPTIME-complete. In addition, we show that it is also EXPTIME-complete to decide whether the query by a given NSTA is definable by a node selecting string automaton.