Free shuffle algebras in language varieties
Theoretical Computer Science
Handbook of formal languages, vol. 3
Shuffle on trajectories: syntactic constraints
Theoretical Computer Science
Mappings of languages by two-tape devices
Journal of the ACM (JACM)
Shuffle languages, Petri nets, and context-sensitive grammars
Communications of the ACM
Complexity of expressions allowing concurrency
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Algebraic and Automata-Theoretic Properties of Formal Languages
Handbook of Formal Languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
Synchronized Shuffle and Regular Languages
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Fair and Associative Infinite Trajectories
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
On the Semantics of Fair Parallelism
Proceedings of the Abstract Software Specifications, 1979 Copenhagen Winter School
An algebraic system for process structuring and interprocess communication
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Theoretical Computer Science
Associative Omega-products of Traces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Software Descriptions with Flow Expressions
IEEE Transactions on Software Engineering
Component composition preserving behavioural contracts based on communication traces
CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
| Hi-index | 5.24 |
We consider a general shuffling operation for finite and infinite words which is not necessarily fair. This means that it may be the case that in a shuffle of two words, from some point onwards, one of these words prevails ad infinitum even though the other word still has letters to contribute. Prefixes and limits of shuffles are investigated, leading to a characterization of general shuffles in terms of shuffles of finite words, a result which does not hold for fair shuffles. Associativity of shuffling is an immediate corollary.