Infinite unfair shuffles and associativity

被引：5
|
作者：
ter Beek, Maurice H.
Kleijn, Jetty
机构：
[1] CNR, Ist Sci & Tecnol Informaz, I-56124 Pisa, Italy
[2] Leiden Univ, LIACS, NL-2300 RA Leiden, Netherlands
来源：
THEORETICAL COMPUTER SCIENCE | 2007年 / 380卷 / 03期
关键词：
shuffling; infinite words; fairness; associativity;
D O I：
10.1016/j.tcs.2007.03.030
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
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. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码：401 / 410
页数：10
相关论文
共 50 条
12345