Skip to content
Register Sign in Wishlist

Foundations of XML Processing
The Tree-Automata Approach

  • Date Published: November 2010
  • availability: In stock
  • format: Hardback
  • isbn: 9780521196130


Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • This is the first book that provides a solid theoretical account of the foundation of the popular data format XML. Part I establishes basic concepts, starting with schemas, tree automata and pattern matching, and concluding with static typechecking for XML as a highlight of the book. In Part II, the author turns his attention to more advanced topics, including efficient 'on-the-fly' tree automata algorithms, path- and logic-based queries, tree transformation, and exact typechecking. The author provides many examples of code fragments to illustrate features, and exercises to enhance understanding. Thus the book will be ideal for students and researchers whether just beginning, or experienced in XML research.

    • Presents the basic theory with numerous examples, informal explanations and exercises
    • Helps the reader to find the connections between theory and practice
    • Ideal for anyone who wants to make their XML systems robust
    Read more

    Reviews & endorsements

    '[This] book is obviously interesting to theoretical computer scientists, and to developers who may implement their own XML parsers and retrieval mechanisms (it provides hints for the underlying implementations). Instructors at a university may also use the book in an advanced course on XML.' K. Waldh├Âr,

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: November 2010
    • format: Hardback
    • isbn: 9780521196130
    • length: 238 pages
    • dimensions: 254 x 179 x 16 mm
    • weight: 0.62kg
    • contains: 10 b/w illus. 60 exercises
    • availability: In stock
  • Table of Contents

    1. Introduction
    2. Preliminaries
    3. Schemas
    4. Tree automata
    5. Pattern matching
    6. Marking tree automata
    7. Typechecking
    8. On-the-fly algorithms
    9. Alternating tree automata
    10. Tree transducers
    11. Exact typechecking
    12. Path expressions and tree-walking automata
    13. Logic-based queries
    14. Ambiguity
    15. Unorderedness

  • Author

    Haruo Hosoya, University of Tokyo
    Haruo Hosoya is Assistant Professor in the Department of Computer Science at the University of Tokyo.

Sign In

Please sign in to access your account


Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.