Succinctness of the complement and intersection of regular expressions

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 325-336

  Gelade, Wouter ^a,b   Neven, Frank ^a  

^a HASSELT UNIVERSITY   (Belgium)

^b FUND FOR SCIENTIFIC RESEARCH   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ARBITRARY NUMBER; DOUBLE EXPONENTIAL; LOWER BOUNDS; POLYNOMIAL-TIME; REGULAR EXPRESSIONS; XML SCHEMAS;

PATTERN MATCHING;

EID: 45749122317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. AW, 1974.
2. G.J. Bex, F. Neven, T. Schwentick, and K. Tuyls. Inference of concise DTDs from XML data. In Very Large Data Bases, pp. 115-126, 2006.
3. G.J. Bex, F. Neven, and Stijn Vansummeren. Inferring XML Schema Definitions from XML data. In Very Large Data Bases, pp. 998-1009, 2007.
4. T. Bray, J. Paoli, CM. Sperberg-McQueen, E. Maler, and F. Yergeau. Extensible Markup Language (XML). World Wide Web Consortium, 2004. http://www.w3.org/TR/REC-xml/.
5. A. Brüggemann-Klein. Regular expressions into finite automata. Theoretical Computer Science, 120(2):197-213, 1993.
6. A. Brüggemann-Klein and D. Wood. One-unambiguous regular languages. Information and Computation, 142(2): 182-206, 1998.
7. Z. R. Dang. On the complexity of a finite automaton corresponding to a generalized regular expression. Dokl. Akad. Nauk SSSR, 1973.
8. A. Ehrenfeucht and H. Zeiger. Complexity measures for regular expressions. Journal of Computer and System Sciences, 12(2):134-146, 1976.
9. K. Ellul, B. Krawetz, J. Shallit, and M. Wang. Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics, 10(4):407-437, 2005.
10. M. Fürer. The complexity of the inequivalence problem for regular expressions with intersection. In International Colloquium on Automata, Languages and Programming, pp. 234-245, 1980.
11. W. Gelade, W. Martens, and F. Neven. Optimizing schema languages for XML: Numerical constraints and interleaving. In International Conference on Database Theory, pp. 269-283, 2007.
12. W. Gelade and F. Neven. Succinctness of pattern-based schema languages for XML. In Database Programming Languages 2007, LNCS 4797, pp. 202-216
13. G. Ghelli, D. Colazzo, and C. Sartiani. Efficient inclusion for a class of XML types with interleaving and counting. In Database Programming Languages 2007, LNCS 4797, pp. 231-245.
14. N. Globerman and D. Harel. Complexity results for two-way and multi-pebble automata and their logics. Theoretical Computer Science, 169(2):161-184, 1996.
15. M. Grohe and N. Schweikardt. The succinctness of first-order logic on linear orders. Logical Methods in Computer Science, 1(1), 2005.
16. H. B. Hunt III. The equivalence problem for regular expressions with intersection is not polynomial in tape. Technical report, Department of Computer Science, Cornell University, 1973.
17. L. Hie and S. Yu. Algorithms for computing small nfas. In Mathematical Foundations of Computer Science, pp. 328-340, 2002.
18. T. Jiang and B. Ravikumar. A note on the space complexity of some decision problems for finite automata. Information Processing Letters, 40(1):25-31, 1991.
19. D. Kozen. Lower bounds for natural proof systems. In FOCS 1977, pp. 254-266, IEEE.
20. O. Kupferman and S. Zuhovitzky. An improved algorithm for the membership problem for extended regular expressions. In Mathematical Foundations of Computer Science, pp. 446-458, 2002.
21. L. Libkin. Logics for unranked trees: An overview. In International Colloquium on Automata, Languages and Programming, pp. 35-50, 2005.
22. W. Martens, F. Neven, and T. Schwentick. Complexity of decision problems for simple regular expressions. In Mathematical Foundations of Computer Science, pp. 889-900, 2004.
23. W. Martens, F. Neven, T. Schwentick, and G. J. Bex. Expressiveness and complexity of XML Schema. ACM Transactions on Database Systems, 31(3):770-813, 2006.
24. R. McNaughton and H. Yamada. Regular expressions and state graphs for automata. IEEE Transactions on Electronic Computers, 9(1):39-47, 1960.
25. M. Murata, D. Lee, M. Mani, and K. Kawaguchi. Taxonomy of XML schema languages using formal language theory. ACM Transactions on Internet Technologies, 5(4):660-704, 2005.
26. G. Myers. A four Russians algorithm for regular pattern matching. J. of the ACM, 39(2):432-448, 1992.
27. F. Neven. Automata, logic, and XML. In Conference for Computer Science Logic, pp. 2-26, 2002.
28. H. Petersen. The membership problem for regular expressions with intersection is complete in LOGCFL. In Proc. STACS 2002, Lect. Notes in Comp. Science 2285, pp. 513-522, Springer (2002).
29. n space. Information Processing Letters, 9(5):220-222, 1979.
30. G. Rosu and M. Viswanathan. Testing extended regular language membership incrementally by rewriting. In Rewriting Techniques and Applications, pp. 499-514, 2003.
31. T. Schwentick. Automata for XML - a survey. J. Comp, and System Sciences, 73(3), 289-315, 2007.
32. C.M. Sperberg-McQueen and H. Thompson. XML Schema. http://www.w3.org/XML/ Schema, 2005.
33. L. Stockmeyer and A. Meyer. Word problems requiring exponential time. In Symposium on the Theory of Computing, pp. 1-9, 1973.
34. V. Vianu. Logic as a query language: From Frege to XML. In Proc. STACS 2003, pp. 1-12, Lect. Notes in Comp. Science 2607, Springer (2003).
35. V. Waizenegger. Uber die Effizienz der Darstellung durch reguläre Ausdrücke und endliche Automaten. Diplomarbeit, RWTH Aachen, 2000.
36. S. Yu. Handbook of formal languages, volume 1, chapter 2, pp. 41-110. Springer, 1997.
37. D. Ziadi. Regular expression for a language without empty word. Theoretical Computer Science, 163(1&2):309-315, 1996.