References
- [1] A. B
ernini , S. Bilotta , R. Pinzani , A. Sabri and V. Vajnovszki , Reected Gray codes for q-ary words avoiding a given factor, Acta Inform., 52 (2015) 573–592. - [2] J. B
ertrand , Solution d'un probléme, C. R. Math. Acad. Sci. Paris, 105 (1887) 369. - [3] M. C. E
r , On generating the N-ary reected Gray code, IEEE Trans. Comput., 33 (1984) 739-741. - [4] F. G
ray , Pulse code communication, U.S. Patent 2632058, 1953. - [5] P. K
lingsberg , A Gray code for compositions, J. Algorithms, 3 (1981) 41–44. - [6] D. E. K
nuth , Dancing links, available at https://arxiv.org/pdf/cs/0011047.pdf. - [7] J. M. L
ucas , D. R.van Baronaigien and F. Ruskey , On rotations and the generation of binary trees, J. Algorithms, 15 (1993) 1-24. - [8] N. J. A. S
loane , The On-line Encyclopedia of Integer Sequences, at http://oeis.org. - [9] M. R
enault , Lost (and found) in translation: André's actual method and its application to the generalized ballot problem, Amer. Math. Monthly, 115 (2008) 358–363. - [10] F. R
uskey , Combinatorial Generation, in preparation, 2003. - [11] A. S
abri and V. Vajnovszki , Two reected Gray code based orders on some restricted growth sequences, The Computer Journal, 58 (2015) 1099–1111. - [12] A. S
abri and V. Vajnovszki , More restricted growth functions: Gray codes and exhaustive generations, Graphs Combin., 33 (2017) 573–582. - [13] A. S
abri , V. Vajnovszki , Exhaustive generation for ballot sequences in lexicographic and Gray code order, In: L. Ferrari, M. Vamvakari (Eds.), Proceedings of the 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures, Athens, Greece, June 18-20, 2018. CEUR Workshop Proceedings, 2113 (2018) 195–201. - [14] B. S
agan , The Symmetric Group: Representations, Combinatorial Algorithms, and Symmetric Functions, Springer-Verlag, New York, 2001. - [15] R. P. S
tanley , Enumerative Combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, 62. Cambridge University Press, Cambridge, 1999. - [16] V. V
ajnovszki , A loopless generation of bitstrings without p consecutive ones, In: C. S. Calude, M. J. Dineen, S. Sburlan (Eds.), Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science. Springer-Verlag, London, 2001, pp. 227–240. - [17] V. V
ajnovszki , More restrictive Gray codes for necklaces and Lyndon words, Inform. Process. Lett., 106 (2008) 96–99. - [18] V. V
ajnovszki and R. Vernay , Restricted compositions and permutations: from old to new Gray codes, Inform. Process. Lett., 111 (2011) 650–655. - [19] T. W
alsh , Loop-free sequencing of bounded integer compositions, J. Combin. Math. Combin. Comput., 33 (2000) 323–345. - [20] T. W
alsh , Generating Gray codes in O(1) worst-case time per word, Lecture Notes in Comput. Sci., 2731 (2003) 71–88.