Complexity Results on Balanced Context-Free Languages

DMCA

Complexity Results on Balanced Context-Free Languages (2007)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Akihiko Tozawa , Yasuhiko Minamide

Venue:	FOSSACS'07
Citations:	3 - 0 self

BibTeX

@MISC{Tozawa07complexityresults,
    author = {Akihiko Tozawa and Yasuhiko Minamide},
    title = {Complexity Results on Balanced Context-Free Languages},
    year = {2007}
}

OpenURL

Abstract

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 contextfree 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 2EXPTIMEcomplete. 1

Keyphrases

balanced context-free language complexity result balancedness problem xml string context-free language validation problem decision problem cfg-rhg containment problem static analysis regular hedge grammar important problem contextfree grammar new result paired alphabet

DMCA