Complexity results on balanced context-free languages

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4423 LNCS, Issue , 2007, Pages 346-360

  Tozawa, Akihiko ^a   Minamide, Yasuhiko ^b  

^a IBM RESEARCH   (United States)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONTEXT FREE GRAMMARS; DECISION THEORY; PROBLEM SOLVING; STATIC ANALYSIS; XML;

REGULAR HEDGE GRAMMAR (RHG); XML STRINGS;

CONTEXT FREE LANGUAGES;

EID: 37149015182     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71389-0_25     Document Type: Conference Paper

References (16)

1. Jean Berstel and Luc Boasson. Balanced grammars and their languages. In Formal and Natural Computing: Essays Dedicated to Grzegorz, volume 2300 of LNCS, pages 3-25, 2002.
2. Jean Berstel and Luc Boasson. Formal properties of XML grammars and languages. Acta Informatica, 38(9):649-671, 2002.
3. Jean Berstel. Transductions and Context-Free Languages. Teubner Studien-bucher, 1979.
4. Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. J. ACM, 28(1):114-133, 1981.
5. Christian Hagenah. Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD thesis, Universität Stuttgart, Fakultät Informatik, 2000.
6. Christian Kirkegaard and Anders Møller. Static analysis for Java Servlets and JSP. In Proc. 13th International Static Analysis Symposium, SAS '06, volume 4134 of LNCS, August 2006.
7. Donald E. Knuth. A characterization of parenthesis languages. Information and Control, 11(3):269-289, 1967.
8. Eugene Lawler. Combinatorial Optimization: Networks and Matroids, chapter 3. 1976.
9. Robert McNaughton. Parenthesis grammars. Journal of the Association for Computing Machinery, 14(3):490-500, 1967.
10. A. R. Meyer and L. J. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Conf. Rec. 13th IEEE Symp. on Switching and Automata Theory, pages 125-129, 1972.
11. Yasuhiko Minamide and Akihiko Tozawa. XML validation for context-free grammars. In Proc. of The Fourth ASIAN Symposium on Programming Languages and Systems, volume 4279 of LNCS, pages 357-373, 2006.
12. Wojciech Plandowski. Testing equivalence of morphisms on context-free languages. In Algorithms - ESA '94 (Utrecht), volume 855 of LNCS, pages 460-470. Springer, 1994.
13. Saul Schleimer. Polynomial-time word problems, 2006. http ://front.math.ucdavis.edu/math.GR/0608563.
14. Helmut Seidl. Deciding equivalence of finite tree automata. SIAM Journal on Computing, 19(3):424-437, 1990.
15. Larry J. Stockmeyer and Albert R. Meyer. Word problems requiring exponential time: Preliminary report. In STOC, pages 1-9, 1973.
16. Masako Takahashi. Generalizations of regular sets and their application to a study of context-free languages. Information and Control, 21(1):1-36, 1975.