Succinctness of regular expressions with interleaving, intersection and counting

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

Volumn 5162 LNCS, Issue , 2008, Pages 363-374

  Gelade, Wouter ^a  

^a HASSELT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EXPONENTIAL SIZES; LOWER BOUNDS; REGULAR EXPRESSIONS;

COMPUTER SCIENCE; COMPUTERS; CONTROL THEORY; FINITE AUTOMATA; FOUNDATIONS; MATHEMATICAL OPERATORS; NANOSTRUCTURED MATERIALS; TRANSLATION (LANGUAGES);

INTERSECTIONS;

EID: 54249160062     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85238-4_29     Document Type: Conference Paper

References (32)

1. Bex, G., Gelade, W., Neven, F., Vansummeren, S.: Learning deterministic regular expressions for the inference of schemas from XML data. In: WWW, pp. 825-834 (2008)
2. Bex, G., Neven, F., Schwentick, T., Tuyls, K.: Inference of concise DTDs from XML data. In: VLDB, pp. 115-126 (2006)
3. Bex, G., Neven, F., Vansummeren, S.: Inferring XML Schema Definitions from XML data. In: VLDB, pp. 998-1009 (2007)
4. Bruggemann-Klein, A.: Regular expressions into finite automata. Theoretical Computer Science 120(2), 197-213 (1993)
5. Clark, J., Murata, M.: RELAX NG Specification. OASIS (December 2001)
6. Cohen, R.S.: Rank-non-increasing transformations on transition graphs. Information and Control 20(2), 93-113 (1972)
7. Eggan, L.C.: Transition graphs and the star height of regular events. Michigan Mathematical Journal 10, 385-397 (1963)
8. Ehrenfeucht, A., Zeiger, H.: Complexity measures for regular expressions. Journal of Computer and System Sciences 12(2), 134-146 (1976)
9. Ellul, K., Krawetz, B., Shallit, J., Wang, M.: Regular expressions: New results and open problems. Journal of Automata, Languages and Combinatorics 10(4), 407-437 (2005)
10. Fürer, M.: The complexity of the inequivalence problem for regular expressions with intersection. In: ICALP, pp. 234-245 (1980)
11. Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: Numerical constraints and interleaving. In: Schwentick, T., Suciu, D. (eds.) 1CDT 2007. LNCS, vol. 4353, pp. 269-283. Springer, Heidelberg (2006)
12. Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. In: STAGS, pp. 325-336 (2008)
13. Gruber, H., Holzer, M.: Finite automata, digraph connectivity, and regular expression size. In: ICALP (to appear, 2008)
14. Gruber, H., Holzer, M.: Language operations with regular expressions of polynomial size. In: DCFS (to appear, 2008)
15. Gruber, H., Johannsen, J.: Optimal lower bounds on regular expression size using communication complexity. In: Amadio, R. M. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 273-286. Springer, Heidelberg (2008)
16. Hume, A.: A tale of two greps. Software, Practice and Experience 18(11), 1063-1072 (1988)
17. Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Information Processing Letters 40(1), 25-31 (1991)
18. Kilpelainen, P., Tuhkanen, R.: Regular expressions with numerical occurrence indicators - preliminary results. In: SPLST 2003, pp. 163-173 (2003)
19. Kupferman, O., Zuhovitzky, S.: An improved algorithm lor the membership problem lor extended regular expressions. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol. 2420, pp. 446-458. Springer, Heidelberg (2002)
20. Mayer, A.J., Stockmeyer, L.J.: Word problems-this time with interleaving. Information and Computation 115(2), 293-311 (1994)
21. McNaughton, R.: The loop complexity of pure-group events. Information and Control 11(1/2), 167-176 (1967)
22. McNaughton, R.: The loop complexity ol regular events. Information Sciences 1(3), 305-328 (1969)
23. Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: FOCS, pp. 125-129 (1972)
24. Petersen, H.: Decision problems for generalized regular expressions. In: DCAGRS, pp. 22-29 (2000)
25. Petersen, H.: The membership problem for regular expressions with intersection is complete in LOGCFL. In: Alt, H., Ferreira, A. (eds.) STAGS 2002. LNCS, vol. 2285, pp. 513-522. Springer, Heidelberg (2002)
26. Robson, J.M.: The emptiness ol complement problem for semi extended regular expressions requires c space. Information Processing Letters 9(5), 220-222 (1979)
27. Schott, R., Spehner, J.C.: Shuffle ol words and araucaria trees. Fundamenta Informatica 74(4), 579-601 (2006)
28. Sperberg-McQueen, C.M., Thompson, H.: XML Schema (2005), http://www.w3.org/XML/Schema
29. Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: STOC., pp. 1-9 (1973)
30. Wall, L., Christiansen, T., Orwant, J.: Programming Perl, 3rd edn. OReilly, Sebastopol (2000)
31. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook ol formal languages, ch. 2, vol. 1, pp. 41-110. Springer, Heidelberg (1997)
32. Yu, S.: State complexity ol regular languages. Journal ol Automata, Languages and Combinatorics 6(2), 221-234 (2001)