On the Complexity of Iterated Shuffle
暂无分享,去创建一个
[1] William C. Rounds,et al. Complexity of expressions allowing concurrency , 1978, POPL '78.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[3] Jay L. Gischer. Shuffle languages, Petri nets, and context-sensitive grammars , 1981, CACM.
[4] Matthias Jantzen. The Power of Synchronizing Operations on Strings , 1981, Theor. Comput. Sci..
[5] David S. Johnson,et al. Complexity Results for Multiprocessor Scheduling under Resource Constraints , 1975, SIAM J. Comput..
[6] Toshiro ARAKI,et al. Relations of Flow Languages to Petri Net Languages , 1981, Theor. Comput. Sci..
[7] Matthias Jantzen,et al. Extending Regular Expressions with Iterated Shuffle , 1985, Theor. Comput. Sci..
[8] Alan C. Shaw,et al. Software Descriptions with Flow Expressions , 1978, IEEE Transactions on Software Engineering.
[9] Takayuki Kimura. An algebraic system for process structuring and interprocess communication , 1976, STOC '76.