Advertisement

Definability by Weakly Deterministic Regular Expressions with Counters is Decidable

  • Markus Latte
  • Matthias Niewerth
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9234)

Abstract

We show that weakly deterministic regular expressions with counters (WDREs) —as they are used in XML Schema— are at most exponentially larger than equivalent DFAs. As a consequence, the problem, whether a given DFA is equivalent to any WDRE, is decidable in EXPSPACE.

Keywords

Normal Form Regular Expression Regular Language Parse Tree Alphabet Symbol 
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

  1. 1.
    Bex, G.J., Gelade, W., Martens, W., Neven, F.: Simplifying XML Schema: effortless handling of nondeterministic regular expressions. In: ACM SIGMOD, pp. 731–744. ACM (2009)Google Scholar
  2. 2.
    Brüggemann-Klein, A.: Regular expressions into finite automata. TCS 120(2), 197–213 (1993)CrossRefzbMATHGoogle Scholar
  3. 3.
    Brüggemann-Klein, A., Wood, D.: One-unambiguous regular languages. Inf. Comput. 142(2), 182–206 (1998)CrossRefzbMATHGoogle Scholar
  4. 4.
    Chen, H., Lu, P.: Checking determinism of regular expressions with counting. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol. 7410, pp. 332–343. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  5. 5.
    Czerwiński, W., David, C., Losemann, K., Martens, W.: Deciding definability by deterministic regular expressions. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol. 7794, pp. 289–304. Springer, Heidelberg (2013) CrossRefGoogle Scholar
  6. 6.
    Gelade, W., Gyssens, M., Martens, W.: Regular expressions with counting: weak versus strong determinism. SIAM J. Comp. 41(1), 160–190 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    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) CrossRefGoogle Scholar
  8. 8.
    Hovland, D.: The membership problem for regular expressions with unordered concatenation and numerical constraints. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 313–324. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  9. 9.
    Kilpeläinen, P.: Checking determinism of XML schema content models in optimal time. Inf. Syst. 36(3), 596–617 (2011)CrossRefGoogle Scholar
  10. 10.
    Kilpeläinen, P., Tuhkanen, R.: Towards efficient implementation of XML schema content models. In: DocEng, pp. 239–241. ACM (2004)Google Scholar
  11. 11.
    Kilpeläinen, P., Tuhkanen, R.: One-unambiguity of regular expressions with numeric occurrence indicators. Inf. Comput. 205(6), 890–916 (2007)CrossRefzbMATHGoogle Scholar
  12. 12.
    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) CrossRefGoogle Scholar
  13. 13.
    Losemann, K., Martens, W., Niewerth, M.: Closure properties and descriptional complexity of deterministic regular expressions. Submitted, (2015)Google Scholar
  14. 14.
    Lu, P., Bremer, J., Chen, H.: Deciding determinism of regular languages. TOCS 57(1), 1–43 (2014)MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  1. 1.Universität BayreuthBayreuthGermany

Personalised recommendations