Advertisement

Complexity Results on Balanced Context-Free Languages

  • Akihiko Tozawa
  • Yasuhiko Minamide
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4423)

Abstract

Some decision problems related to balanced context-free languages are important for their application to the static analysis of programs generating XML strings. One such problem is the balancedness problem which decides whether or not the language of a given context-free grammar (CFG) over a paired alphabet is balanced. Another important problem is the validation problem which decides whether or not the language of a CFG is contained by that of a regular hedge grammar (RHG). This paper gives two new results; (1) the balancedness problem is in PTIME; and (2) the CFG-RHG containment problem is 2EXPTIME-complete.

References

  1. [BB02a]
    Berstel, J., Boasson, L.: Balanced grammars and their languages. In: Brauer, W., et al. (eds.) Formal and Natural Computing. LNCS, vol. 2300, pp. 3–25. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  2. [BB02b]
    Berstel, J., Boasson, L.: Formal properties of XML grammars and languages. Acta Informatica 38(9), 649–671 (2002)zbMATHCrossRefMathSciNetGoogle Scholar
  3. [Ber79]
    Berstel, J.: Transductions and Context-Free Languages. Teubner Studienbücher. Teubner, Wiesbaden (1979)zbMATHGoogle Scholar
  4. [CKS81]
    Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114–133 (1981), doi:10.1145/322234.322243zbMATHCrossRefMathSciNetGoogle Scholar
  5. [Hag00]
    Hagenah, C.: Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD thesis, Universität Stuttgart, Fakultät Informatik (2000)Google Scholar
  6. [KM06]
    Kirkegaard, C.: Static analysis for Java Servlets and JSP. In: Yi, K. (ed.) SAS 2006. LNCS, vol. 4134, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. [Knu67]
    Knuth, D.E.: A characterization of parenthesis languages. Information and Control 11(3), 269–289 (1967)zbMATHCrossRefGoogle Scholar
  8. [Law76]
    Lawler, E.: Combinatorial Optimization: Networks and Matroids (1976)Google Scholar
  9. [McN67]
    McNaughton, R.: Parenthesis grammars. Journal of the Association for Computing Machinery 14(3), 490–500 (1967)zbMATHMathSciNetGoogle Scholar
  10. [MS72]
    Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Conf. Rec. 13th IEEE Symp. on Switching and Automata Theory, pp. 125–129. IEEE Computer Society Press, Los Alamitos (1972)Google Scholar
  11. [MT06]
    Minamide, Y., Tozawa, A.: XML validation for context-free grammars. In: Kobayashi, N. (ed.) APLAS 2006. LNCS, vol. 4279, pp. 357–373. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  12. [Pla94]
    Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460–470. Springer, Heidelberg (1994)CrossRefGoogle Scholar
  13. [Sch06]
    Schleimer, S.: Polynomial-time word problems (2006), http://front.math.ucdavis.edu/math.GR/0608563
  14. [Sei90]
    Seidl, H.: Deciding equivalence of finite tree automata. SIAM Journal on Computing 19(3), 424–437 (1990)zbMATHCrossRefMathSciNetGoogle Scholar
  15. [SM73]
    Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: Preliminary report. In: Stoc, pp. 1–9 (1973)Google Scholar
  16. [Tak75]
    Takahashi, M.: Generalizations of regular sets and their application to a study of context-free languages. Information and Control 21(1), 1–36 (1975)CrossRefGoogle Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Akihiko Tozawa
    • 1
  • Yasuhiko Minamide
    • 2
  1. 1.IBM Research, Tokyo Research Laboratory, IBM Japan, Ltd. 
  2. 2.Department of Computer Science, University of Tsukuba 

Personalised recommendations