Deciding equivalence of finite tree automata
SIAM Journal on Computing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Balanced Grammars and Their Languages
Formal and Natural Computing - Essays Dedicated to Grzegorz Rozenberg [on occasion of his 60th birthday, March 14, 2002]
Testing Equivalence of Morphisms on Context-Free Languages
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Static analysis for java servlets and JSP
SAS'06 Proceedings of the 13th international conference on Static Analysis
XML validation for context-free grammars
APLAS'06 Proceedings of the 4th Asian conference on Programming Languages and Systems
An Efficient Algorithm for the Inclusion Problem of a Subclass of DPDAs
Language and Automata Theory and Applications
Interprocedural Dataflow Analysis over Weight Domains with Infinite Descending Chains
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Equivalence of deterministic nested word to word transducers
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Verified decision procedures on context-free grammars
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Weighted pushdown systems with indexed weight domains
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
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.