Recognizing Shuffled Languages
2011 (English)Report (Other academic)
Language models that use interleaving, or shuffle, operators have applications in various areas of computer science, including system verification, plan recognition, and natural language processing. We study the complexity of the membership problem for such models, i.e., how difficult it is to determine if a string belongs to a language or not. In particular, we investigate how interleaving can be introduced into models that capture the context-free languages.
Place, publisher, year, edition, pages
Umeå: Umeå University , 2011. , 29 p.
Report / UMINF, ISSN 0348-0542 ; 11.01
IdentifiersURN: urn:nbn:se:umu:diva-54172OAI: oai:DiVA.org:umu-54172DiVA: diva2:516272