The Membership Problem for the Shuffle of Two Deterministic Linear Context-Free Languages is NP-complete
2012 (English)Report (Other academic)
Formal language models which employ shuffling, or interleaving, of strings are of interest in many areas of computer science. Notable examples include system verification, plan recognition, and natural language processing. Membership problems for the shuffle of languages are especially interesting. It is known that deciding membership for shuffles of regular languages can be done in polynomial time, and that deciding (non-uniform) membership in the shuffle of two deterministic context-free languages is NP-complete. In this paper we narrow the gap by showing that the non-uniform membership problem for the shuffle of two deterministic *linear* context-free languages is NP-complete.
Place, publisher, year, edition, pages
Umeå: Department of Computing Science, Umeå University , 2012. , 10 p.
Report / UMINF, ISSN 0348-0542 ; 12.09
shuffle, reordering, complexity, membership problems
IdentifiersURN: urn:nbn:se:umu:diva-54163OAI: oai:DiVA.org:umu-54163DiVA: diva2:516213