Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/978-3-642-21254-3_10 | LATA |
Keywords | Field | DocType |
computer science | Programming language,Computer science,Theoretical computer science,Operator (computer programming),Plan recognition,Membership problem,Interleaving,Language model,System verification | Conference |
Volume | ISSN | Citations |
6638 | 0302-9743 | 7 |
PageRank | References | Authors |
0.51 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Berglund | 1 | 38 | 6.52 |
| Henrik Björklund | 2 | 311 | 20.41 |
| Johanna Högberg | 3 | 94 | 6.72 |