Associativity of Infinite Synchronized Shuffles and Team Automata

Ter Beek M. H., Kleijn J.

fairness  Computational Theory and Mathematics  synchronized shuffling  Algebra and Number Theory  Theoretical Computer Science  Team automata  associativity and compositionality  Information Systems  infinite words 

Motivated by different ways to obtain team automata from synchronizing component automata, we consider various definitions of synchronized shuffles of words. A shuffle of two words is an interleaving of their symbol occurrences which preserves the original order of these occurrences within each of the two words. In a synchronized shuffle, however, also two occurrences of one symbol, each from a different word, may be identified as a single occurrence. In case at least one of the words involved is infinite, a (synchronized) shuffle can also be unfair in the sense that an infinite word may prevail from some point onwards even when the other word still has occurrences to contribute to the shuffle. We prove that for the synchronized shuffle operations under consideration, every (fair or unfair) synchronized shuffle can be obtained as a limit of synchronized shuffles of the finite prefixes of the words involved. In addition, it is shown that with the exception of one, all synchronized shuffle operations that we consider satisfy a natural notion of associativity, also in case of unfairness. Finally, using these results, some compositionality results for team automata are established.

Source: Fundamenta informaticae 91 (2009): 437–461. doi:10.3233/FI-2009-0051

Publisher: North-Holland, Amsterdam , Paesi Bassi

Metrics