Shuffle languages are in P

This publication has 8 references indexed in Scilit:

• The Complexity of Word Problems - This Time with Interleaving
  Information and Computation, 1994
• Concurrent regular expressions and their relationship to Petri nets
  Theoretical Computer Science, 1992
• Nesting of shuffle closure is important
  Information Processing Letters, 1987
• Extending regular expressions with iterated shuffle
  Theoretical Computer Science, 1985
• On the enlargement of the class of regular languages by the shuffle closure
  Information Processing Letters, 1983
• The power of synchronizing operations on strings
  Theoretical Computer Science, 1981
• Software Descriptions with Flow Expressions
  IEEE Transactions on Software Engineering, 1978
• Complexity of expressions allowing concurrency
  Published by Association for Computing Machinery (ACM) ,1978