论文标题
进一步的结果是纯求和登记册和互补的结果
Further Results on Pure Summing Registers and Complementary Ones
论文作者
论文摘要
我们完全决定纯求和寄存器(PSR)和互补求和寄存器(CSR)的周期结构。基于CSR的状态图,我们得出了一种算法,以生成由Tuvi Etzion在1984年出版的CSR循环产生的de Bruijn循环。然后,我们指出,我们指出的是,我们在扩展代表的概括中的限制,我们在提出的算法中使用了PSR和CSR的证明,并以PSR和CSR均包含pure Cycles divers n+n+1。
We decide completely the cycle structure of pure summing register (PSR) and complementary summing register (CSR). Based on the state diagram of CSR, we derive an algorithm to generate de Bruijn cycles from CSR inspired by Tuvi Etzion's publication in 1984. We then point out the limitation in generalizations of extended representation we use in the algorithm proposed, with a proof of the fact that only PSR and CSR contain pure cycles all dividing n+1.