M.Sc. thesis

Bibliography

The list of references from the thesis I submitted in partial fulfilment of an M.Sc. in Informatics at the University of Edinburgh

  1. A. Aho and J. Ullman. Principles of Compiler Design. Addison-Wesley, Reading, Mass., 1977.

  2. M. Altinel and M. J. Franklin. Efficient filtering of XML documents for selective dissemination of information. VLDB Journal, 9:53–64, 2000.

  3. M. Arenas, W. Fan, and L. Libkin. What’s hard about XML Schema constraints? Lecture Notes in Computer Science, 2453:269–278, 2002.

  4. M. Benedikt, W. Fan, and G. M. Kuper. Structural properties of XPath fragments. Lecture Notes in Computer Science, 2572:79–95, 2003.

  5. P. V. Biron and A. Malhotra. XML Schema Part 2: Datatypes, 2001. http://www.w3.org/TR/xmlschema-2/.

  6. S. Boag, D. Chamberlin, M. Fernandez, D. Florescu, J. Robie, and J. Siméon. XQuery 1.0: An XML Query Language, 2002. http://www.w3.org/TR/xquery/.

  7. T. Bray, J. Paoli, C. M. Sperberg-McQueen, and E. Maler. Extensible Markup Language (XML) 1.0 (Second Edition), 2000. http://www.w3.org/TR/2000/REC-xml-20001006.

  8. D. Carlisle, P. Ion, R. Miner, and N. Poppelier. Mathematical Markup Language (MathML) Version 2.0, 2001. http://www.w3.org/TR/MathML2/.

  9. C. Chan, P. Felber, M. Garofalakis, and R. Rastogi. Efficient filtering of XML documents with XPath expressions. In R. Agrawal, K. Dittrich, and A. H. H. Ngu, editors, Proc. of the 18th Int’l Conf. on Data Engineering, pages 235–244, San Jose, Calif., 2002. IEEE Comput. Soc.

  10. J. Clark. XSL Transformations (XSLT), 1999. http://www.w3.org/TR/xslt.

  11. J. Clark and S. DeRose. XML Path Language (XPath) Version 1.0, 1999. http://www.w3.org/TR/1999/REC-xpath-19991116.

  12. The Unicode Consortium. The Unicode Standard. Addison-Wesley Developers Press, Reading, Mass., 2000.

  13. A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu. XML-QL: A Query Language for XML, 2002. http://www.w3.org/TR/NOTE-xml-ql/.

  14. J. Earley. An efficient context-free parsing algorithm. Communications of the ACM, 6(8):451–455, 1970.

  15. D. C. Fallside. XML Schema Part 0: Primer, 2001. http://www.w3.org/TR/2001/REC-xmlschema-0-20010502/.

  16. J. Ferraiolo. Scalable Vector Graphics (SVG) 1.0 Specification, 2001. http://www.w3.org/TR/SVG/.

  17. International Organization for Standardization. ISO 8879:1986(E). Information processing — Text and office systems — Standard Generalized Markup Language (SGML), 1986. Geneva, Switzerland.

  18. G. Gottlob, C. Koch, and R. Pichler. Efficient algorithms for processing XPath queries. In Proc. of the 28th Int’l Conf. on Very Large Databases, pages 95–106, Hong Kong, China, 2002. Morgan Kaufmann Publishers.

  19. G. Gottlob, C. Koch, and R. Pichler. XPath processing in a nutshell. SIGMOD Record, 32(1):12–19, 2003.

  20. T. J. Green, G. Miklau, M. Onizuka, and D. Suciu. Processing XML streams with deterministic automata. Lecture Notes in Computer Science, 2572:173–189, 2003.

  21. S. Holzner. Inside XML. New Riders, Indianapolis, Ind, 2001.

  22. H. Hosoya and B. C. Pierce. XDuce: a typed XML processing language. In Int’l Workshop on the Web and Databases, Dallas, Tex., 2000.

  23. D. Jurafsky and J. H. Martin. Speech and Language Processing. Prentice-Hall, Upper Saddle River, NJ., 2000.

  24. S. C. Kleene. Representation of events in nerve nets and finite automata. In C. Shannon and J. McCarthy, editors, Automata Studies, pages 3–41. Princeton University Press, Princeton, NJ., 1956.

  25. M. Lutz and D. Ascher. Learning Python. O’Reilly & Associates, Sebastopol, Calif., 1999.

  26. W. S. McCulloch and W. Pitts. A logical calculus of ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, pages 115–133, 1943. Reprinted in Neurocomputing: Foundations of Research, ed. by J. A. Anderson and E. Rosenfeld, MIT Press 1988.

  27. F. Neven. Automata theory for XML researchers. SIGMOD Record, 31(3):39–46, 2002.

  28. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3(2):114–125, 1959.

  29. H. S. Thompson. W3C XML Pointer, XML Base and XML Linking, 2003. http://www.w3.org/XML/Linking.

  30. H. S. Thompson, D. Beech, M. Maloney, and N. Mendelsohn. XML Schema Part 1: Structures, 2001. http://www.w3.org/TR/xmlschema-1/.

  31. H. S. Thompson and R. Tobin. Current status of XSV: Coverage, known bugs, etc., 2003. http://www.ltg.ed.ac.uk/~ht/xsv-status.html.

  32. H. S. Thompson and R. Tobin. Using finite state automata to implement W3C XML Schema content model validation and restriction checking. In Proc. of the European XML Conference, p. 11, 2003. https://www.ltg.ed.ac.uk/~ht/XML_Europe_2003.html

  33. A. M. Turing. On computable numbers, with an application to the Entsheidungsproblem. Proc. of the London Mathematical Society, 42:230–265, 1936. A correction was published in the following volume, pp. 544–546.


This is a chapter of the thesis I submitted in partial fulfilment of an M.Sc. in Informatics at the University of Edinburgh. Read the full thesis.