Abstract
We investigate the complexity of deciding whether a given regular language can be defined with a deterministic regular expression. Our main technical result shows that the problem is PSPACE-complete if the input language is represented as a regular expression or nondeterministic finite automaton. The problem becomes EXPSPACE-complete if the language is represented as a regular expression with counters.
This work was supported by grant number MA 4938/2-1 of the Deutsche Forschungsgemeinschaft (Emmy Noether Nachwuchsgruppe).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Arenas, M., Barceló, P., Libkin, L., Murlak, F.: Foundations of Data Exchange. Book (to appear, 2013)
Balmin, A., Papakonstantinou, Y., Vianu, V.: Incremental validation of XML documents. ACM Trans. on Datab. Syst. 29(4), 710–751 (2004)
Bex, G.J., Gelade, W., Martens, W., Neven, F.: Simplifying XML Schema: effortless handling of nondeterministic regular expressions. In: ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 731–744 (2009)
Bex, G.J., Gelade, W., Neven, F., Vansummeren, S.: Learning deterministic regular expressions for the inference of schemas from XML data. In: World Wide Web Conference (WWW), pp. 825–834 (2008)
Bray, T., Paoli, J., Sperberg-McQueen, C.M., Maler, E., Yergeau, F.: Extensible Markup Language XML 1.0, 5th edn. W3C Recommendation (November 2008)
Brüggemann-Klein, A., Wood, D.: Deterministic Regular Languages. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 173–184. Springer, Heidelberg (1992)
Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. and Comput. 142(2), 182–206 (1998)
Chen, H., Chen, L.: Inclusion Test Algorithms for One-Unambiguous Regular Expressions. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 96–110. Springer, Heidelberg (2008)
Colazzo, D., Ghelli, G., Sartiani, C.: Efficient inclusion for a class of XML types with interleaving and counting. Inform. Syst. 34(7), 643–656 (2009)
Fallside, D., Walmsley, P.: XML Schema Part 0: Primer, 2nd edn. World Wide Web Consortium (October 2004)
Gelade, W., Gyssens, M., Martens, W.: Regular expressions with counting: Weak versus strong determinism. SIAM J. Comput. 41(1), 160–190 (2012)
Gelade, W., Martens, W., Neven, F.: Optimizing schema languages for XML: Numerical constraints and interleaving. SIAM J. Comput. 38(5), 2021–2043 (2009)
Gelade, W., Neven, F.: Succinctness of the complement and intersection of regular expressions. ACM Trans. on Comput. Logic 4, 1–19 (2012)
Groz, B., Maneth, S., Staworko, S.: Deterministic regular expressions in linear time. In: ACM Symposium on Principles of Database Systems (PODS), pp. 49–60 (2012)
Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison Wesley (2007)
Hovland, D.: Regular Expressions with Numerical Constraints and Automata with Counters. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 231–245. Springer, Heidelberg (2009)
Jones, N.D.: Space-bounded reducibility among combinatorial problems. J. Comput. Syst. Sci. 11(1), 68–85 (1975)
Kilpeläinen, P.: Checking determinism of XML Schema content models in optimal time. Inform. Syst. 36(3), 596–617 (2011)
Kilpeläinen, P., Tuhkanen, R.: One-unambiguity of regular expressions with numeric occurrence indicators. Inform. and Comput. 205(6), 890–916 (2007)
Konrad, C., Magniez, F.: Validating XML documents in the streaming model with external memory. In: International Conference on Database Theory (ICDT), pp. 34–45 (2012)
Losemann, K., Martens, W., Niewerth, M.: Descriptional Complexity of Deterministic Regular Expressions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 643–654. Springer, Heidelberg (2012)
Maneth, S., Berlea, A., Perst, T., Seidl, H.: XML type checking with macro tree transducers. In: ACM Symposium on Principles of Database Systems (PODS), pp. 283–294 (2005)
Martens, W., Neven, F.: On the complexity of typechecking top-down XML transformations. Theor. Comp. Sc. 336(1), 153–180 (2005)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. Syst. Sci. 66(1), 66–97 (2003)
Neven, F., Schwentick, T.: On the complexity of XPath containment in the presence of disjunction, DTDs, and variables. Log. Meth. in Comp. Sc. 2(3) (2006)
Segoufin, L., Vianu, V.: Validating streaming XML documents. In: ACM Symposium on Principles of Database Systems (PODS), pp. 53–64 (2002)
van Emde Boas, P.: The convenience of tilings. In: Complexity, Logic and Recursion Theory, pp. 331–363. Marcel Dekker Inc. (1997)
Wood, P.T.: Containment for XPath Fragments under DTD Constraints. In: Calvanese, D., Lenzerini, M., Motwani, R. (eds.) ICDT 2003. LNCS, vol. 2572, pp. 297–311. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Czerwiński, W., David, C., Losemann, K., Martens, W. (2013). Deciding Definability by Deterministic Regular Expressions. In: Pfenning, F. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2013. Lecture Notes in Computer Science, vol 7794. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-37075-5_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-37075-5_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-37074-8
Online ISBN: 978-3-642-37075-5
eBook Packages: Computer ScienceComputer Science (R0)