Recognizing Shuffled Languages

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 deter...

Full description

Saved in:
Bibliographic Details
Published inLanguage and Automata Theory and Applications pp. 142 - 154
Main Authors Berglund, Martin, Björklund, Henrik, Högberg, Johanna
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2011
SeriesLecture Notes in Computer Science
Subjects
interleaving
membership problems
shuffle languages
Online AccessGet full text

Cover

More Information
Summary: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.
ISBN:9783642212536
3642212530
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-642-21254-3_10