Regular expressions with counting: Weak versus strong determinism

SIAM Journal on Computing

Volumn 41, Issue 1, 2012, Pages 160-190

  Gelade, Wouter ^a   Gyssens, Marc ^a   Martens, Wim ^b  

^a HASSELT UNIVERSITY   (Belgium)

^b UNIVERSITY OF BAYREUTH   (Germany)

Author keywords

Automata; Counters; Determinism; Numerical occurrence indicators; Regular expressions

Indexed keywords

AUTOMATA; DECISION PROBLEMS; DETERMINISM; DETERMINISTIC AUTOMATA; NATURAL EXTENSION; REGULAR EXPRESSIONS; UPPER BOUND;

FINITE AUTOMATA; RADIATION COUNTERS;

PATTERN MATCHING;

EID: 84861598470     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/100814196     Document Type: Article

References (26)

1. A. Brüggemann-Klein, Regular expressions into finite automata, Theoret. Comput. Sci., 120 (1993), pp. 197-213.
2. A. Brüggemann-Klein and D. Wood, One-unambiguous regular languages, Inform. Comput., 142 (1998), pp. 182-206.
3. D. Colazzo, G. Ghelli, and C. Sartiani, Efficient asymmetric inclusion between regular expression types, in Proceedings of the 12th International Conference on Database Theory (ICDT), ACM, New York, 2009, pp. 174-182.
4. S. Dal-Zilio and D. Lugiez, XML schema, tree logic and sheaves automata, in Proceedings of the 14th International Conference on Rewriting Techniques and Applications (RTA), Springer, Berlin, Heidelberg, 2003, pp. 246-263.
5. J. Esparza, Decidability and complexity of petri net problems-An introduction, in Lectures on Petri Nets I: Basic Models, Springer, Berlin, 1998, pp. 374-428.
6. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, 1979.
7. W. Gelade, Succinctness of regular expressions with interleaving, intersection and counting, in Mathematical Foundations of Computer Science, Springer, Berlin, 2008, pp. 363-374.
8. W. Gelade, M. Gyssens, and W. Martens, Regular expressions with counting: Weak versus strong determinism (extended abstract), in Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, Springer, Berlin, Heidelberg, 2009, pp. 369-381.
9. W. Gelade, W. Martens, and F. Neven, Optimizing schema languages for XML: Numerical constraints and interleaving, SIAM J. Comput., 38 (2009), pp. 2021-2043.
10. D. Hovland, Regular expressions with numerical constraints and automata with counters, in Theoretical Aspects of Computing-ICTAC 2009, Springer, Berlin, 2009, pp. 231-245.
11. A. Hume, A tale of two greps, Softw. Pract. Exper., 18 (1988), pp. 1063-1072.
12. P. Kilpeläinen, Inclusion of Unambiguous RE#s Is NP-Hard, http://arxiv.org/abs/1111.0422 (2011).
13. P. Kilpeläinen, Checking determinism of XML Schema content models in optimal time, Inf. Syst., 36 (2011), pp. 596-617.
14. P. Kilpeläinen and R. Tuhkanen, Regular expressions with numerical occurrence indicators-Preliminary results, in Proceedings of the Eighth Symposium on Programming Languages and Software Tools (SPLST), 2003, pp. 163-173.
15. P. Kilpeläinen and R. Tuhkanen, Towards efficient implementation of XML schema content models, in Proceedings of the ACM Symposium on Document Engineering (DOCENG), ACM, New York, 2004, pp. 239-241.
16. P. Kilpeläinen and R. Tuhkanen, One-unambiguity of regular expressions with numeric occurrence indicators, Inform. Comput., 205 (2007), pp. 890-916.
17. C. Koch and S. Scherzinger, Attribute grammars for scalable query processing on XML streams, VLDB Journal, 16 (2007), pp. 317-342.
18. W. Martens, F. Neven, and T. Schwentick, Complexity of decision problems for simple regular expressions, in Mathematical Foundations of Computer Science, Springer, Berlin, 2004, pp. 889-900.
19. A. R. Meyer and L. J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in Proceedings of the 13th Annual Symposium on Switching and Automata Theory, IEEE Computer Society, Washington, DC, 1972, pp. 125-129.
20. D. W. Mount, Bioinformatics: Sequence and Genome Analysis, Cold Spring Harbor Laboratory Press, Woodbury, NY, 2004.
21. G. Pighizzini and J. Shallit, Unary language operations, state complexity and Jacobsthal's function, Internat. J. Found. Comput. Sci., 13 (2002), pp. 145-159.
22. H. Seidl, T. Schwentick, A. Muscholl, and P. Habermehl, Counting in trees for free, in Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), Springer, Berlin, 2004, pp. 1136-1149.
23. C. M. Sperberg-McQueen, Notes on Finite State Automata with Counters, http://www.w3. org/XML/2004/05/msm-cfa.html (2004).
24. C. M. Sperberg-McQueen and H. Thompson, XML Schema, http://www.w3.org/ XML/ Schema (2005).
25. M. Y. Vardi, From monadic logic to PSL, in Pillars of Computer Science, Springer, Berlin, 2008, pp. 656-681.
26. L. Wall, T. Christiansen, and J. Orwant, Programming Perl, 3rd ed., O'Reilly Media, Sebastopol, CA, 2000.