Skip to main content
SpringerLink
Log in

Query Automata for Nested Words

  • Conference paper
Book cover Mathematical Foundations of Computer Science 2009 (MFCS 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5734))

Abstract

We study visibly pushdown automata (VPA) models for expressing and evaluating queries on words with a nesting structure. We define a query VPA model, which is a 2-way deterministic VPA that can mark in one run all positions in a document that satisfy a query, and show that it is equi-expressive as unary monadic queries. This surprising result parallels a classic result by Hopcroft and Ullman for queries on regular word languages. We also compare our model to query models on unranked trees, and show that our result is fundamentally different from those known for automata on trees.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: STOC, pp. 202–211. ACM Press, New York (2004)

    Google Scholar 

  2. Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol. 4036, pp. 1–13. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 105–118. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  4. Engelfriet, J., Hoogeboom, H.J.: Mso definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Logic 2(2), 216–254 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Frick, M., Grohe, M., Koch, C.: Query evaluation on compressed trees (extended abstract). In: LICS, p. 188. IEEE Computer Society, Los Alamitos (2003)

    Google Scholar 

  6. Gauwin, O., Niehren, J., Roos, Y.: Streaming tree automata. Inf. Process. Lett. 109(1), 13–17 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  7. Kamimura, T., Slutzki, G.: Parallel and two-way automata on directed ordered acyclic graphs. Information and Control 49(1), 10–51 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  8. Neumann, A.: Parsing and querying xml documents in sml. Universität Trier, Trier, Germany (1999)

    Google Scholar 

  9. Neumann, A., Seidl, H.: Locating matches of tree patterns in forests. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol. 1530, pp. 134–146. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  10. Neven, F., Schwentick, T.: Query Automata over Finite Trees. Theoretical Computer Science 275(1-2), 633–674 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  11. Schwentick, T.: Personal communication (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Illinois, Urbana-Champaign

    P. Madhusudan & Mahesh Viswanathan

Authors
  1. P. Madhusudan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahesh Viswanathan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Faculty of Mathematics, Physics and Informatics, Comenius University, Research partially funded by grant APVV 0433-06, Bratislava, Slovakia

    Rastislav Královič

  2. Members of EACSL Jury for the Ackermann Award, Poland

    Damian Niwiński

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Madhusudan, P., Viswanathan, M. (2009). Query Automata for Nested Words. In: Královič, R., Niwiński, D. (eds) Mathematical Foundations of Computer Science 2009. MFCS 2009. Lecture Notes in Computer Science, vol 5734. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03816-7_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03816-7_48

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03815-0

  • Online ISBN: 978-3-642-03816-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation