Skip to main content
SpringerLink
Log in

Automata, Logic, and XML

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2471))

Included in the following conference series:

Abstract

We survey some recent developments in the broad area of automata and logic which are motivated by the advent of XML. In particular, we consider unranked tree automata, tree-walking automata, and automata over infinite alphabets. We focus on their connection with logic and on questions imposed by XML.

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. S. Abiteboul. Semistructured data: from practice to theory. In Proc. 16th IEEE Symposium on Logic in Computer Science (LICS 2001), pages 379–386, 2001.

    Google Scholar 

  2. S. Abiteboul, P. Buneman, and D. Suciu. Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, 1999.

    Google Scholar 

  3. S. Abiteboul, L. Herr, and J. Van den Bussche. Temporal connectives versus explicit timestamps to query temporal databases. Journal of Computer and System Sciences, 58(1):54–68, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. A.V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform, and Control, 19:439–475, 1971.

    Article  MathSciNet  Google Scholar 

  5. N. Alon, T. Milo, F. Neven, D. Suciu, and V. Vianu. XML with data values: Type-checking revisited. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 560–572, 2001.

    Google Scholar 

  6. G. J. Bex, S. Maneth, and F. Neven. A formal model for an expressive fragment of XSLT. Information Systems, 27(1):21–39, 2002.

    Article  MATH  Google Scholar 

  7. R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Journal of Computer and System Sciences, 61(1):1–50, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  8. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets: Version 1, April 3, 2001. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.

    Google Scholar 

  9. A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages, 2(1):81–106, 2000.

    Article  Google Scholar 

  10. J. Clark. XML Path Language (XPath). http://www.w3.org/TR/xpath.

  11. E. Codd. A relational model for large shared databanks. Communications of the ACM, 13(6):377–387, 1970.

    Article  MATH  Google Scholar 

  12. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.

  13. M. Consens and T. Milo. Algebras for querying text regions: Expressive power and optimization. Journal of Computer and System Sciences, 3:272–288, 1998.

    Article  MathSciNet  Google Scholar 

  14. World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML/.

  15. World Wide Web Consortium. XML schema. http://www.w3.org/XML/Schema.

  16. P. Deransart, M. Jourdan, and B. Lorho. Attribute Grammars: Definition, Systems and Bibliography, volume 323 of Lecture Notes in Computer Science. Springer, 1988.

    Google Scholar 

  17. J. Doner. Tree acceptors and some of their applications. Journal of Computer and System Sciences, 4:406–451, 1970.

    Article  MATH  MathSciNet  Google Scholar 

  18. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.

    Google Scholar 

  19. J. Engelfriet and H. J. Hoogeboom. Tree-walking pebble automata. In J. Karhumäki, H. Maurer, G. Paun, and G. Rozenberg, editors, Jewels are forever, contributions to Theoretical Computer Science in honor of Arto Salomaa, pages 72–83. Springer-Verlag, 1999.

    Google Scholar 

  20. J. Engelfriet and H. J. Hoogeboom. Private communication. 2002.

    Google Scholar 

  21. J. Engelfriet, H. J. Hoogeboom, and J.-P. vanBest. Trips on trees. Acta Cybernetica, 14:51–64, 1999.

    MATH  MathSciNet  Google Scholar 

  22. M. Frick and M. Grohe. The complexity of first-order and monadic second-order logic revisited. In Proc. 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002.

    Google Scholar 

  23. Z. Fülöp and S. Maneth. Domains of partial attributed tree transducers. Information Processing Letters, 73(5–6):175–180, 2002.

    Google Scholar 

  24. F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1–68. Springer, 1997.

    Google Scholar 

  25. G. Gottlob and C. Koch. Monadic datalog and the expresive power of languages for web information extraction. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 17–28. ACM Press, 2002.

    Google Scholar 

  26. E. Grädel and Y. Gurevich. Metafinite model theory. Information and Computation, 140(1):26–81, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  27. H. Hosoya and B. C. Pierce. Regular expression pattern matching for XML. In Proceedings of 28th Symposium on Principles of Programming Languages (POPL 2001), pages 67–80. ACM Press, 2001.

    Google Scholar 

  28. J. Hromkovic. Communication Complexity and Parallel Computing. Texts in Theoretical Computer Science-An EATCS Series. Springer-Verlag, 2000.

    Google Scholar 

  29. N. Immerman. Descriptive Complexity. Springer, 1998.

    Google Scholar 

  30. M. Kaminski and N. Francez. Finite-memory automata. Theoretical Computer Science, 134(2):329–363, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  31. D. Lee, M. Mani, and M. Murata. Reasoning about XML schema languages using formal language theor. Technical report, IBM Almaden Research Center, 2000. Log# 95071.

    Google Scholar 

  32. W. Martens and F. Neven. Typechecking top-down uniform unranked tree transducers. Manuscript.

    Google Scholar 

  33. G. Miklau and D. Suciu. Containment and equivalence for an XPath fragment. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 65–76, 2002.

    Google Scholar 

  34. T. Milo, D. Suciu, and V. Vianu. Type checking for XML transformers. In Proceedings of the Nineteenth ACM Symposium on Principles of Database Systems, pages 11–22. ACM Press, 2000.

    Google Scholar 

  35. M. Murata. Data model for document transformation and assembly. In E.V. Munson, K. Nicholas, and D. Wood, editors, Proceedings of the workshop on Principles of Digital Document Processing, volume 1481 of Lecture Notes in Computer Science, pages 140–152, 1998.

    Chapter  Google Scholar 

  36. M. Murata. Extended path expressions for xml. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 126–137. ACM Press, 2001.

    Google Scholar 

  37. A. Neumann and H. Seidl. Locating matches of tree patterns in forests. In V. Arvind and R. Ramanujam, editors, Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, pages 134–145. Springer, 1998.

    Google Scholar 

  38. F. Neven. Extensions of attribute grammars for structured document queries. In R. Connor and A. Mendelzon, editors, Research Issues in Structured and Semistructured Database Programming (DBPL’99), volume 1949 of Lecture Notes in Computer Science, pages 97–114. Springer, 2000.

    Chapter  Google Scholar 

  39. F. Neven. On the power of walking for querying tree-structured data. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 77–84. ACM Press, 2002.

    Google Scholar 

  40. F. Neven and T. Schwentick. Expressive and efficient pattern languages for tree-structured data. In Proc. 19th Symposium on Principles of Database Systems (PODS 2000), pages 145–156, 2000.

    Google Scholar 

  41. F. Neven and T. Schwentick. On the power of tree-walking automata. In U. Montanari, J. D.P. Rolim, and E. Welzl, editors, International Colloquium on Automata, Languages and Programming (ICALP 2000), volume 1853 of Lecture Notes in Computer Science, pages 547–560. Springer, 2000.

    Chapter  Google Scholar 

  42. F. Neven and T. Schwentick. Automata-and logic-based pattern languages for tree-structured data. Unpublished, 2001.

    Google Scholar 

  43. F. Neven and T. Schwentick. Query automata on finite trees. Theoretical Computer Science, 275:633–674, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  44. F. Neven, T. Schwentick, and V. Vianu. Towards regular languages over infinite alphabets. In J. Sgall, A. Pultr, and P. Kolman, editors, Mathematical Foundations of Computer Science (MFCS 2001), volume 2136 of Lecture Notes in Computer Science, pages 560–572. Springer, 2001.

    Chapter  Google Scholar 

  45. F. Neven and J. Van den Bussche. Expressiveness of structured document query languages based on attribute grammars. Journal of the ACM, 49(1), 2002.

    Google Scholar 

  46. C. Pair and A. Quere. Définition et etude des bilangages réguliers. Information and Control, 13(6):565–593, 1968.

    Article  MATH  MathSciNet  Google Scholar 

  47. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 35–46. ACM Press, 2001.

    Google Scholar 

  48. A. Potthoff. Logische Klassifizierung regulärer Baumsprachen. Doctor’s thesis, Institut für Informatik u. Prakt. Math., Universit”at Kiel, 1994.

    Google Scholar 

  49. E.T. Ray. Learning XML. O’Reilly, 2001.

    Google Scholar 

  50. T. Schwentick. On diving in trees. In Proceedings of 25th Mathematical Foundations of Computer Science (MFCS 2000), pages 660–669, 2000.

    Google Scholar 

  51. L. Segoufin and V. Vianu. Validating streaming XML documents. In Proc. 21th Symposium on Principles of Database Systems (PODS 2002), pages 53–64. ACM Press, 2002.

    Google Scholar 

  52. H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal on Computing, 19(3):424–437, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  53. G. Slutzki. Alternating tree automata. Theoretical Computer Science, 41(2–3):305–318, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  54. D. Suciu. Typechecking for semistructured data. In Proceedings of the 8th Workshop on Data Bases and Programming Languages (DBPL 2001), 2001.

    Google Scholar 

  55. M. Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 27(1):1–36, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  56. J.W. Thatcher and J. B. Wright. Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory, 2(1):57–81, 1968.

    Article  MathSciNet  Google Scholar 

  57. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 7, pages 389–456. Springer, 1997.

    Google Scholar 

  58. J. Van den Bussche. Applications of Alfred Tarski’s ideas in database theory. In L. Fribourg, editor, Computer Science Logic (CSL 2001), volume 2142 of Lecture Notes in Computer Science, pages 20–37. Springer, 2001.

    Chapter  Google Scholar 

  59. M. Y. Vardi. Automata theory for database theoreticians. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, pages 83–92. ACM Press, 1989.

    Google Scholar 

  60. V. Vianu. Databases and finite-model theory. In N. Immerman and Ph. Kolaitis, editors, Descriptive Complexity and Finite Models, volume 31 of AMS DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 97–148. American Mathematical Society, 1997.

    Google Scholar 

  61. V. Vianu. A web odyssey: From Codd to XML. In Proc. 20th Symposium on Principles of Database Systems (PODS 2001), pages 1–15, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Limburg, USA

    Frank Neven

Authors
  1. Frank Neven
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Laboratory for Foundations of Computer Science Division of Informatics, University of Edinburgh, King’s Buildings, Mayfield Road, Edinburgh, EH9 3JZ, UK

    Julian Bradfield

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Neven, F. (2002). Automata, Logic, and XML. In: Bradfield, J. (eds) Computer Science Logic. CSL 2002. Lecture Notes in Computer Science, vol 2471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45793-3_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45793-3_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44240-0

  • Online ISBN: 978-3-540-45793-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation