Abstract
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. © 2011 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Berglund, M., Björklund, H., & Högberg, J. (2011). Recognizing shuffled languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6638 LNCS, pp. 142–154). Springer Verlag. https://doi.org/10.1007/978-3-642-21254-3_10
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
