Structured document transformations based on XSL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1949, Issue , 2000, Pages 80-98

  Maneth, Sebastian ^a   Neven, Frank ^b  

^a LEIDEN UNIVERSITY   (Netherlands)

^b HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL LINGUISTICS; COMPUTER PROGRAMMING LANGUAGES; DATABASE SYSTEMS; FORESTRY; FORMAL LOGIC; LINEAR TRANSFORMATIONS; OBJECT ORIENTED PROGRAMMING;

COMPUTATIONAL MODEL; DOCUMENT TRANSFORMATION; DOCUMENT TYPE DEFINITION; MONADIC SECOND-ORDER LOGIC; NATURAL GENERALIZATION; REGULAR EXPRESSIONS; STRUCTURED DOCUMENT; TOP-DOWN TREE TRANSDUCERS;

MATHEMATICAL TRANSFORMATIONS;

EID: 84959043080     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44543-9_6     Document Type: Conference Paper

References (24)

1. S. Abiteboul. On views and XML. In Proceedings of the 18th ACM Symposium on Principles of Database Systems, pages 1–9. ACM Press, 1999.
2. A. Bosworth. A proposal for an XSL query language. http://www.w3.org/TandS/QL/QL98/pp/microsoft-extensions.html.
3. A. Brüggemann-Klein, M. Murata, and D. Wood. Regular tree languages over non-ranked alphabets (draft 1). Manuscript, 1998.
4. J. Clark and S. Deach. Extensible stylesheet language (XSL). http://www.w3.org/TR/WD-xsl.
5. World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML/.
6. Frank Drewes and Joost Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1–50, 1998.
7. H.-D. Ebbinghaus and J. Flum. Finite Model Theory. Springer, 1995.
8. J. Engelfriet. Bottom-up and top-down tree transformations — a comparison. Math. Systems Theory, 9(3):198–231, 1975.
9. J. Engelfriet and G. Filè. Passes and paths of attribute grammars. Inform. And Control, 49:125–169, 1981.
10. J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput., 154:34–91, 1999.
11. J. Engelfriet and S. Maneth. Characterizing and Deciding MSO-definability of Macro Tree Transductions. To appear in Proc. STACS’00.
12. J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150–202, 1980.
13. J. Engelfriet and H. Vogler. Macro tree transducers. J. Of Comp. Syst. Sci.31:71–146, 1985.
14. Z. Fülöp. Undecidable properties of deterministic top-down tree transducers. Theoret. Comput. Sci., 134:311–328, 1994.
15. M. Jazayeri, W. F. Ogden, and W. C. Rounds. The intrinsically exponential complexity of the circularity problem for attribute grammars. Comm. ACM, 18:697–706, 1975.
16. B. Ludäscher, Y. Papakonstantinou, P. Velikhov, and V. Vianu. View definition and DTD inference for XML. In Proceedings of the Workshop on Query Processing for Semistructured Data and Non-Standard Data Formats, 1999.
17. S. Maneth. The generating power of total deterministic tree transducers. Inform. and Comput., 147:111–144, 1998.
18. M. Murata. Forest-regular languages and tree-regular languages. Manuscript, 1995.
19. F. Neven and T. Schwentick. Query automata. In Proceedings of the 18th ACM Symposium on Principles of Database Systems, pages 205–214. ACM Press, 1999.
20. C. Pair and A. Quere. Définition et etude des bilangages réguliers. Information and Control, 13(6):565–593, 1968.
21. Y. Papakonstantinou and V. Vianu. DTD Inference for Views of XML Data. To appear in Proc. PODS’2000. ACM Press, 2000.
22. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: Preliminary report. In Proc. STOC’73, pages 1-9, 1973.
23. D. Suciu. Semistructured data and XML. In Proceedings of International Conference on Foundations of Data Organization, 1998.
24. 2 sequential machine maps. J. of Comp. Syst. Sci., 4:339–367, 1970.