一类限制增长序列的两种基于阶的反射格雷码
Two Reflected Gray Code based orders on some restricted growth sequences
摘要：
本文考虑了m元反射格雷码及其后缀分块变分引起的两种序关系，证明了这两种序关系在应用于某些限制增长序列集时仍能产生格雷码。这些序列集是：subexcedant或ascent序列，限制增长函数和楼梯词。在每种情况下，我们给出了有效的穷举生成算法，并比较所获得的结果。
英文摘要：
We consider two order relations: that induced by the m-ary reflected Gray code and a suffix partitioned variation of it. We show that both of them when applied to some sets of restricted growth sequences still yield Gray codes. These sets of sequences are: subexcedant or ascent sequences, restricted growth functions, and staircase words. In each case we give efficient exhaustive generating algorithms and compare the obtained results.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
