Document - Infinite Unfair Shuffles and Associativity

2005

Conference article Open Access

Infinite Unfair Shuffles and Associativity

Ter Beek M., Kleijn J.

Shuffles Associativity Combinatorics

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.

Source: International Conference on Words (WORDS'05), pp. 129–146, Montreal, Canada, 13-17 September 2005

Back to previous page

Cite as

BibTeX entry

@inproceedings{oai:it.cnr:prodotti:91209,
	title = {Infinite Unfair Shuffles and Associativity},
	author = {Ter Beek M. and Kleijn J.},
	booktitle = {International Conference on Words (WORDS'05), pp. 129–146, Montreal, Canada, 13-17 September 2005},
	year = {2005}
}