Concurrent regular expressions and their relationship to Petri nets
Theoretical Computer Science
The complexity of word problems—this time with interleaving
Information and Computation
Axiomatizing shuffle and concatenation in languages
Information and Computation
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Theoretical Computer Science
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Techniques for Plan Recognition
User Modeling and User-Adapted Interaction
Tight lower bound for the state complexity of shuffle of regular languages
Journal of Automata, Languages and Combinatorics
On the complexity of ID/LP parsing 1
Computational Linguistics
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Two-Variable Logic on Words with Data
LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Aspects of shuffle and deletion on trajectories
Theoretical Computer Science
Treebank grammar techniques for non-projective dependency parsing
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics
Non-projective dependency parsing in expected linear time
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Shuffle expressions and words with nested data
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Parameterized Complexity
Uniform distributed pushdown automata systems
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Theoretical Computer Science
A Hierarchy of Languages with Catenation and Shuffle
Fundamenta Informaticae - Concurrency, Specification and Programming
Properties of Languages with Catenation and Shuffle
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
| Hi-index | 0.00 |
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.