Process algebra
Free shuffle algebras in language varieties
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
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Automata, Languages, and Machines
Automata, Languages, and Machines
Handbook of Formal Languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Handbook of Process Algebra
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
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
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
Infinite unfair shuffles and associativity
Theoretical Computer Science
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Associativity of Infinite Synchronized Shuffles and Team Automata
Fundamenta Informaticae
Synchronized Shuffle on Backbones
Fundamenta Informaticae - SPECIAL ISSUE ON TRAJECTORIES OF LANGUAGE THEORY Dedicated to the memory of Alexandru Mateescu
| Hi-index | 5.23 |
We extend the basic shuffle on words and languages, a well-known operation in theoretical computer science, by introducing three synchronized shuffles. These synchronized shuffles have some relevance to molecular biology since they may be viewed as the formal representations of various forms of gene linkage during genome shuffling. More precisely, each synchronized shuffle preserves the genetic backbone of the organisms, as well as the linked genes, by requiring the synchronization of some predefined genes while all other genes are arbitrarily shuffled. As for their mathematical properties, we prove that in a trio the closure under shuffle is equivalent to the closure under any of the synchronized shuffles studied here. Finally, based on this result, we present an algorithm for deciding whether a given regular language is synchronized shuffle closed.