Complexity of decision problems for simple regular expressions

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

Volumn 3153, Issue , 2004, Pages 889-900

  Martens, Wim ^a   Neven, Frank ^a   Schwentick, Thomas ^b  

^a HASSELT UNIVERSITY   (Belgium)

^b PHILIPPS UNIVERSITY MARBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; PATTERN MATCHING; TREES (MATHEMATICS); XML;

DATA BASE THEORY; DECISION PROBLEMS; INTERSECTION PROBLEM; LOWER AND UPPER BOUNDS; REGULAR EXPRESSIONS; SEMI-STRUCTURED; TREE GRAMMARS; XML SCHEMAS;

DECISION THEORY;

EID: 35048829973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28629-5_70     Document Type: Article

References (26)

1. P. A. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly analysis of systems with unbounded, lossy FIFO channels. In Proc. of CAV 1998, pages 305-318, 1998.
2. G. J. Bex, F. Neven, and J. Van den Bussche. DTDs versus XML Schema: A practical study. To be presented at WebDB 2004.
3. . A. Brüggemann-Klein, M Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets. Technical Report HKUST-TCSC-2001-0, The Hongkong University of Science and Technology, 2001.
4. A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 142(2):182-206, 1998.
5. A. Brüggemann-Klein and D. Wood. Caterpillars: A context specification technique. Markup Languages, 2(1):81-106, 2000.
6. D. Calvanese, De G. Giacomo, M. Lenzerini, and M. Y. Vardi. Reasoning on regular path queries. SIGMOD Record, 32(4):83-92, 2003.
7. B. Choi. What are real DTDs like? In WebDB 2002, pages 43-48, 2002.
8. World Wide Web Consortium. Extensible Markup Language (XML). http://www.w3.org/XML.
9. World Wide Web Consortium. XML Schema. http://www.w3.org/XML/Schema.
10. L. Hemaspaandra and M. Ogihara. The Complexity Theory Companion. Springer, 2002.
11. H. Hosoya and B. C. Pierce. XDuce: A statically typed XML processing language. ACM Transactions on Internet Technology (TOIT), 3(2):117-148, 2003.
12. Harry B. Hunt III, Daniel J. Rosenkrantz, and Thomas G. Szymanski. On the equivalence, containment, and covering problems for the regular and context-free languages. Journal of Computer and System Sciences, 12(2):222-268, 1976.
13. D. Kozen. Lower bounds for natural proof systems. In Proc. FOCS 1977, pages 254-266. IEEE, 1977.
14. W. Martens and F. Neven. Typechecking top-down uniform unranked tree transducers. In Proc. ICDT 2003, pages 64-78, 2003.
15. W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for simple regular expressions: Full version, http://alpha.luc.ac.be/lucp1436/ pubs.html.
16. M. Marx. XPath with conditional axis relations. In Proc. EDBT 2004, pages 477-494, 2004.
17. T. Milo and D. Suciu. Index structures for path expressions. In Proc. ICDT 1999, pages 277-295. 1999.
18. T. Milo, D. Suciu, and V. Vianu. Typechecking for XML transformers. Journal of Computer and System Sciences, 66(l):66-97, 2003.
19. M. Murata, D. Lee, and M. Mani. Taxonomy of XML schema languages using formal language theory. In Extreme Markup Languages, Montreal, Canada, 2001.
20. F. Neven. Automata, logic, and XML. In Proc. CSL 2002, pages 2-26. 2002.
21. Y. Papakonstantinou and V. Vianu. DTD inference for views of XML data. In Proc. PODS 2000, pages 35-46. ACM Press, 2000.
22. H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal on Computing, 19(3):424-437, 1990.
23. H. Seidl. Haskell overloading is DEXPTIME-complete. Information Processing Letters, 52(2):57-60, 1994.
24. L. J. Stockmeyer and A. R. Meyer. Word problems requiring exponential time: Preliminary report. In Proc. STOC 1973, pages 1-9, 1973.
25. E. van der Vlist. Relax NG. O'Reilly, 2003.
26. V. Vianu. A web odyssey: From Codd to XML. In Proc. PODS 2001, pages 1-15, 2001.