One-unambiguity of regular expressions with numeric occurrence indicators

Information and Computation

Volumn 205, Issue 6, 2007, Pages 890-916

  Kilpeläinen, Pekka ^a   Tuhkanen, Rauno ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Interval expression; Numeric iteration; One unambiguity; Regular expression; Unique particle attribution; XML Schema

Indexed keywords

ITERATIVE METHODS; POLYNOMIAL APPROXIMATION; XML;

INTERVAL EXPRESSIONS; NUMERIC ITERATIONS; ONE-UNAMBIGUITY; REGULAR EXPRESSIONS; UNIQUE PARTICLE ATTRIBUTIONS; XML SCHEMAS;

PATTERN MATCHING;

EID: 84856016943     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.12.003     Document Type: Article

References (44)

1. S. Kleene, Realization of events in nerve sets and finite automata, in: C. Shannon, J. McCarthy (Eds.), Automata Studies, Princeton University Press, Princeton, NJ, 1956, pp. 3-42.
2. IEEE, New York, NY, USA, IEEE Std 1003.1-2001 Standard for Information Technology-Portable Operating System Interface (POSIX) Base Definitions, Issue 6(2001).
3. H. Thompson, D. Beech, M. Maloney, N. Mendelsohn (Eds.), XML Schema Part 1: Structures, W3C Recommendation, 2001. Available from: .
4. L. Wall, R. Schwartz, Programming Perl, O'Reilly & Associates, Inc., Sebastopol, CA, 1991.
5. P. Hazel, Perl Compatible Regular Expressions, University of Cambridge. Available from: (2003).
6. International Organization for Standardization, ISO 8879: Information Processing-Text and Office Systems-Standard Generalized Markup Language (SGML) (Oct. 1986).
7. T. Bray, J. Paoli, C. M. Sperberg-McQueen (Eds.), Extensible Markup Language (XML) 1.0, W3C Recommendation, 1998. Available from: .
8. A. Aho, Algorithms for finding patterns in strings, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science-vol. A: Algorithms and Complexity, Elsevier/MIT Press, 1994, pp. 255-300 (Chapter 5).
9. A. Aho, R. Sethi, J. Ullman, Compilers, Principles, Techniques, and Tools, Addison-Wesley, 1986.
10. S. Sippu, E. Soisalon-Soininen, Parsing Theory, vol. I: Languages and Parsing, Springer-Verlag, 1988.
11. M. Crochemore, T. Lecroq, Pattern matching and text compression algorithms, in: A. Tucker (Ed.), The Computer Science and Engineering Handbook, CRC Press, 2003 (Chapter 8).
12. A. Meyer, L. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, in: 13th Annual IEEE Symp. on Switching and Automata theory, IEEE, 1972, pp. 125-129.
13. W. Martens, F. Neven, T. Schwentick, Complexity of decision problems for simple regular expressions, in: J. Fiala, V. Koubek, J. Kratochvíl (Eds.), Proc. of the 29th Intl. Symp. on Mathematical Foundations of Computer Science, Springer-Verlag, 2004, pp. 889-900.
14. A. Brüggemann-Klein, Regular expressions into finite automata, Theoretical Computer Science 120(1993) 197-213.
15. J. Hopcroft, R. Motwani, J. Ullman, Introduction to Automata Theory, Languages, and Computation, second Ed., Addison-Wesley, 2001.
16. D. Wood, Theory of Computation, John Wiley & Sons, Inc., 1987.
17. P. Kilpeläinen, R. Tuhkanen, Regular expressions with numerical occurrence indicators-preliminary results, in: Proc. of the Eighth Symposium on Programming Languages and Software Tools, University of Kuopio, Department of Computer Science, 2003, pp. 163-173.
18. P. Kilpeläinen, Inclusion of unambiguous #REs is NP-hard, unpublished note, University of Kuopio. Available from: . (May 2004).
19. A. Brüggemann-Klein, D. Wood, One-unambiguous regular languages, Information and Computation 142(1998) 182-206. (Pubitemid 128451163)
20. M. Murata, D. Lee, M. Mani, K. Kawaguchi, Taxonomy of XML schema languages using formal language theory, ACM Transactions on Internet Technology 5(4) (2005) 660-704.
21. E. Christensen, F. Curbera, G. Meredith, S. Weerawarana, Web Services Description Language (WSDL) 1.1, W3C Note 15 March 2001. Available from: .
22. G. Alonso, F. Casati, H. Kuno, V. Marhiraju, Web Services-Concepts, Architectures and Applications, Springer-Verlag, 2004.
23. J. Clark, RELAX NG and W3C XML Schema, A message on the posting list ietf-xml-use.imc.org. Available from: (2002).
24. M. Fuchs, A. Brown, Supporting UPA on an extension of XML Schema, in: Extreme Markup Languages 2003, IDEAlliance, Montréal, Québec, 2003. Available from: .
25. H. Thompson, D. Beech, M. Maloney, N. Mendelsohn (Eds.), XML Schema Part 1: Structures Second Edition, W3C Recommendation, 2004. Available from: .
26. A. Brüggemann-Klein, D. Wood, The validation of SGML content models, Mathematical and Computer Modelling 25(4) (1997) 73-84. (Pubitemid 27158940)
27. P. Kilpeläinen, SGML & XML content models, Markup Languages: Theory & Practice 1(2) (1999) 53-76.
28. A. Brown, M. Fuchs, J. Robie, P. Wadler (Eds.), XML Schema: Formal Description, W3C Working Draft, 25 September 2001. Available from: .
29. A. Brown, M. Fuchs, J. Robie, P. Wadler, MSL: a model for W3C XML Schema, Computer Networks 39(5) (2002) 507-521. (Pubitemid 34624055)
30. P. Kilpeläinen, R. Tuhkanen, Towards efficient implementation of XML schema content models, in: Proc. of the 2004 ACM Symposium on Document Engineering, ACM Press, 2004, pp. 239-241. (Pubitemid 40788581)
31. S. Dal Zilio, D. Lugiez, C. Meyssonnier, A logic you can count on, in: Proc. of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, ACM, 2004, pp. 135-146.
32. A. Berlea, Online Evaluation of Regular Tree Queries, Technical Report TUM-I0611, Technische Universität München, Nordic Journal on Computing (to appear).
33. A. Brüggemann-Klein, Unambiguity of extended regular expressions in SGML document grammars, in: T. Lengauer (Ed.), Algorithms - ESA 93, Springer-Verlag, 1993, pp. 73-84.
34. J. Berstel, J.-E. Pin, Local languages and the Berry-Sethi algorithm, Theoretical Computer Science 155(1996) 439-446. (Pubitemid 126412406)
35. R. McNaughton, H. Yamada, Regular expressions and state graphs for automata, IRE Transactions on Electronic Computers 9(1) (1960) 39-47.
36. V. Glushkov, The abstract theory of automata, Russian Mathematical Surveys 16(1961) 1-53.
37. H. Thompson, R. Tobin, Using finite state automata to implement W3C XML Schema content model validation and restriction checking, in: XML Europe 2003, IDEAlliance, London, UK, 2003. Available from: .
38. C. M. Sperberg-McQueen, Applications of Brzozowski derivatives to XML Schema processing, in: Extreme Markup Languages 2005, IDEAlliance, Montréal, Québec, 2005. Available from: .
39. J. Brzozowski, Derivatives of regular expressions, Journal of the ACM 11(4) (1964) 481-494.
40. R. L. Graham, D. E. Knuth, O. Patashnik, Concrete Mathematics, Addison-Wesley, 1989.
41. K. Melhorn, A. Tsakalidis, Data structures, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science - Volume A: Algorithms and Complexity, Elsevier/MIT Press, 1994, pp. 301-341 (Chapter 6).
42. C. F. Goldfarb, The SGML Handbook, Clarendon Press, Oxford, 1990.
43. M. Mani, Keeping chess alive: Doweneed 1-unambiguous content models?, talk given at Extreme Markup Languages 2001 in Montréal. Slides are available at http://web.cs.wpi.edu/~mmani/publications/extreme2001chess.ppt (Aug. 2001)..
44. J. Clark, M. Murata (Eds.), RELAX NG Specification, OASIS, 2001. Available from: .