On the complexity of iterated shuffle
Authors:
- Manfred K. WarmuthMWManfred K. Warmuth
- David HausslerDHDavid Haussler
- 1 June 1984
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 28 (3) , 345-358
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Extending regular expressions with iterated shuffleTheoretical Computer Science, 1985
- Shuffle languages, Petri nets, and context-sensitive grammarsCommunications of the ACM, 1981
- The power of synchronizing operations on stringsTheoretical Computer Science, 1981
- Relations of flow languages to Petri net languagesTheoretical Computer Science, 1981
- Software Descriptions with Flow ExpressionsIEEE Transactions on Software Engineering, 1978
- Complexity of expressions allowing concurrency1978
- An algebraic system for process structuring and interprocess communication1976
- Complexity Results for Multiprocessor Scheduling under Resource ConstraintsSIAM Journal on Computing, 1975