D. Bajic, On construction of cross-bifix-free kernel sets, 2nd MCM COST 2100, 2007.

D. Bajic, A simple suboptimal construction of cross-bifix-free codes, Cryptography and Communications, vol.31, issue.8, pp.27-37, 2014.
DOI : 10.1007/s12095-013-0088-8

J. Baril, ECO generation for p generalized Fibonacci and Lucas permutations, J. Pure Math. and Applications (Pu.M.A.), vol.17, pp.19-37, 2006.

J. Baril, Gray code for permutations with a fixed number of cycles, Discrete Mathematics, vol.307, issue.13, pp.1559-1571, 2007.
DOI : 10.1016/j.disc.2006.09.007

J. Baril, More restrictive Gray codes for some classes of pattern avoiding permutations, Proc. Letters, pp.799-804, 2009.
DOI : 10.1016/j.ipl.2009.03.025

J. Baril, Gray code for permutations with a fixed number of left-to-right minima, Ars Combinatoria, vol.111, pp.225-239, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00832409

E. Barcucci, A. Bernini, and M. Poneti, From Fibonacci to Catalan permutations, Pu.M.A, vol.17, issue.12, pp.1-17, 2006.

A. Bernini, S. Bilotta, R. Pinzani, and V. Vajnovszki, Two Gray codes for qary k-generalized Fibonacci strings, ICTCS13, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00844211

J. R. Bitner, G. Ehrlich, and E. M. Reingold, Efficient generation of the binary reflected gray code and its applications, Communications of the ACM, vol.19, issue.9, pp.517-521, 1976.
DOI : 10.1145/360336.360343

A. Bernini, E. Grazzini, E. Pergola, and R. Pinzani, A general exhaustive generation algorithm for Gray structures, Acta Informatica, vol.157, issue.1, pp.361-376, 2007.
DOI : 10.1007/s00236-007-0053-0

N. L. Biggs, The roots of combinatorics, Historia Mathematica, vol.6, issue.2, pp.109-136, 1979.
DOI : 10.1016/0315-0860(79)90074-0

E. Barcucci, A. Del-lungo, E. Pergola, and R. Pinzani, ECO:a methodology for the enumeration of combinatorial objects, BIBLIOGRAPHY [BMCDK10] M. Bousquet-M ´ elou, A. Claesson, M. Dukes, and S. Kitaev. (2 + 2)-free posets, ascent sequences and pattern avoiding permutations. J. of Comb, pp.435-490, 1999.
DOI : 10.1016/0012-365X(94)00067-1

S. Bilotta, D. Merlini, E. Pergola, and R. Pinzani, Pattern 1 j+1 0 j avoiding binary words, Fundamenta Informaticae, vol.117, pp.35-55, 2012.
DOI : 10.4204/eptcs.63.9
URL : http://doi.org/10.4204/eptcs.63.9

S. Bilotta, E. Pergola, and R. Pinzani, A construction for a class of binary words avoiding 1 j 0 i, Pu.M.A, vol.23, issue.2, pp.81-102, 2012.

S. Bilotta, E. Pergola, and R. Pinzani, A New Approach to Cross-Bifix-Free Sets, IEEE Transactions on Information Theory, vol.58, issue.6, pp.4058-4063, 2012.
DOI : 10.1109/TIT.2012.2189479

J. Berstel, D. Perrin, and C. Reutenauer, Codes and Automata (Encyclopedia of Mathematics and its Applications), 2009.

E. Babson and E. Steingrímsson, Generalized permutation patterns and a classification of the Mahonian statistics, 2000.

J. Baril and V. Vajnovszki, Gray code for derangements, Discrete Applied Mathematics, vol.140, issue.1-3, pp.207-221, 2004.
DOI : 10.1016/j.dam.2003.06.002

J. Baril and V. Vajnovszki, Minimal change list for Lucas strings and some graph theoretic consequences, Theoretical Computer Science, vol.346, issue.2-3, pp.189-199, 2005.
DOI : 10.1016/j.tcs.2005.08.020

W. Y. Chen, A. Y. Dai, T. Dokos, T. Dwyer, and B. E. Sagan, On 021- avoiding ascent sequences, Electr. J. of Combinatorics, vol.20, p.76, 2013.

P. J. Chase, Combination generation and Graylex ordering, Congr. Numer, vol.69, pp.215-242, 1989.

M. Crochemore, C. Hancart, and T. Lecroq, Algorithms on Strings, 2007.
DOI : 10.1017/CBO9780511546853
URL : https://hal.archives-ouvertes.fr/hal-00470109

Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, Cross-Bifix-Free Codes Within a Constant Factor of Optimality, IEEE Transactions on Information Theory, vol.59, issue.7, pp.4668-4674, 2013.
DOI : 10.1109/TIT.2013.2252952

L. Comtet, Advanced Combinatorics, The Art of Finite and Infinite Expansions, D. Reidel, 1974.

N. Dershowitz, A simplified loop-free algorithm for generating permutations, BIT, vol.16, issue.11
DOI : 10.1007/BF01932689

I. Dutour and J. Edou, Object grammars and random generation
URL : https://hal.archives-ouvertes.fr/hal-00958902

M. [. Dukes, T. Flanagan, V. Mansour, and . Vajnovszki, Combinatorial Gray codes for classes of pattern avoiding permutations, Theoretical Computer Science, vol.396, issue.1-3
DOI : 10.1016/j.tcs.2007.12.002

E. W. Dijkstra, On a gauntlet thrown by David Gries, Acta Informatica, vol.6, issue.4, pp.357-359, 1976.
DOI : 10.1007/BF00268136

]. A. De-lind-van-wijngaarden and T. J. Willink, Frame synchronization using distributed sequences, IEEE Transactions on Communications, vol.48, issue.12, pp.2127-2138, 2000.
DOI : 10.1109/26.891223

P. Duncan and E. Steingrímsson, Pattern avoidance in ascent sequences

G. Ehrlich, Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations, Journal of the ACM, vol.20, issue.3, pp.500-513, 1973.
DOI : 10.1145/321765.321781

E. S. Egge and T. Mansour, Restricted permutations, Fibonacci numbers, and k-generalized Fibonacci numbers, Integers: Electr. J. of Comb. Numb. Theory, vol.5, p.1, 2005.

M. C. Er, On Generating the N-ary Reflected Gray Codes, IEEE Transactions on Computers, vol.33, issue.8, pp.739-741, 1984.
DOI : 10.1109/TC.1984.5009360

S. Even, Algorithmic Combinatorics, 1973.

D. Foata and G. Han, New permutation coding and equidistribution of set-valued statistics, Theoretical Computer Science, vol.410, issue.38-40, pp.38-403743, 2009.
DOI : 10.1016/j.tcs.2009.04.027
URL : https://hal.archives-ouvertes.fr/hal-00395705

L. J. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-42, 1981.
DOI : 10.1016/0097-3165(81)90038-8

L. J. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4

F. Gray, Pulse code communication, 1953.

B. R. Heap, Permutations by interchanges. The Comp, Journal, vol.6, pp.293-294, 1963.

S. Heubach and T. Mansour, Combinatorics of compositions and words
DOI : 10.1201/9781420072686

S. M. Johnson, Generation of permutations by adjacent transposition, Mathematics of Computation, vol.17, issue.83
DOI : 10.1090/S0025-5718-1963-0159764-2

R. Kaye, A gray code for set partitions, Proc. Letters, pp.171-173, 1976.
DOI : 10.1016/0020-0190(76)90014-4

S. Kitaev, Patterns in Permutations and Words, 2011.

P. Klingsberg, A Gray code for compositions, Journal of Algorithms, vol.3, issue.1, pp.41-44, 1981.
DOI : 10.1016/0196-6774(82)90006-2

D. E. Knuth, The Art of Computer Programming, 1968.

D. E. Knuth, The Art of Computer Programming, 1973.

D. E. Knuth, The Art of Computer Programming, 2011.

J. F. Korsh, Loopless generation of up???down permutations, Discrete Mathematics, vol.240, issue.1-3, pp.97-122, 2001.
DOI : 10.1016/S0012-365X(00)00387-3

C. W. Ko and F. Ruskey, Generating permutations of a bag by interchanges

C. Laisant, Sur la numérationnum´numération factorielle, application aux permutations, Bulletin de la Soc. Math. de France, vol.16, pp.176-183, 1888.

D. H. Lehmer, Teaching combinatorial tricks to a computer, Proc. Sympos
DOI : 10.1090/psapm/010/0113289

M. Lothaire, Combinatorics on Words (Encyclopedia of Mathematics and its Applications), 1983.

M. Lothaire, Applied Combinatorics on Words, 2005.
DOI : 10.1017/CBO9781107341005
URL : https://hal.archives-ouvertes.fr/hal-00620607

Y. Li and J. Sawada, Gray codes for reflectable languages, Proc. Letters, pp.296-300, 2009.
DOI : 10.1016/j.ipl.2008.11.007

J. E. Ludman, Gray Code Generation for MPSK Signals, IEEE Transactions on Communications, vol.29, issue.10, pp.1519-1522, 1981.
DOI : 10.1109/TCOM.1981.1094886

F. Ruskey and A. Williams, The coolest way to generate combinations, Discrete Mathematics, vol.309, issue.17, pp.5305-5320, 2009.
DOI : 10.1016/j.disc.2007.11.048

C. Savage, A Survey of Combinatorial Gray Codes, SIAM Review, vol.39, issue.4, pp.605-629, 1997.
DOI : 10.1137/S0036144595295272

M. Schork, The r-generalized Fibonacci numbers and Polynomial coefficients, Int. J. Contemp. Math. Sciences, vol.3, pp.1157-1163, 2008.

R. Sedgewick, Permutation Generation Methods, ACM Computing Surveys, vol.9, issue.2, pp.137-164, 1977.
DOI : 10.1145/356689.356692

M. Squire, Gray codes for A-free strings. The Electr, J. of Combinatorics, vol.3, issue.1, 1996.

R. Simion and F. W. Schmidt, Restricted Permutations, European Journal of Combinatorics, vol.6, issue.4, pp.383-406, 1985.
DOI : 10.1016/S0195-6698(85)80052-4

R. Stanley, Enumerative Combinatorics, 1999.

H. Steinhaus, One Hundred Problems in Elementary Mathematics. Basic Books, 1964.

H. F. Trotter, Algorithm 115: Perm, Communications of the ACM, vol.5, issue.8, pp.434-435, 1962.
DOI : 10.1145/368637.368660

V. Vajnovszki, A Loopless Generation of Bitstrings without p Consecutive Ones
DOI : 10.1007/978-1-4471-0717-0_19

V. Vajnovszki, A loopless algorithm for generating the permutations of a multiset, Theoretical Computer Science, vol.307, issue.2, pp.415-431, 2003.
DOI : 10.1016/S0304-3975(03)00228-7

V. Vajnovszki, Gray code order for Lyndon words, Discr. Math. and Theor
URL : https://hal.archives-ouvertes.fr/hal-00966527

V. Vajnovszki, More restrictive Gray codes for necklaces and Lyndon words, Information Processing Letters, vol.106, issue.3
DOI : 10.1016/j.ipl.2007.10.011

V. Vajnovszki, Simple Gray codes constructed by ECO method (extended abstract), JMIT, 2008.

V. Vajnovszki, ECO-based Gray codes generation for particular classes of word (extended abstract), GASCom 2012, 2012.

V. Vajnovszki, Lehmer code transforms and Mahonian statistics on permutations, Permutation Patterns, 2012.
DOI : 10.1016/j.disc.2012.11.030
URL : https://hal.archives-ouvertes.fr/hal-00824066

D. R. Van-baronaigien and F. Ruskey, Generating permutations with given ups and downs, Discrete Applied Mathematics, vol.36, issue.1, pp.57-65, 1992.
DOI : 10.1016/0166-218X(92)90204-N

V. Vajnovszki and R. Vernay, Restricted compositions and permutations: From old to new Gray codes, Proc. Letters, pp.650-655, 2011.
DOI : 10.1016/j.ipl.2011.03.022

T. Walsh, Loop-free sequencing of bounded integer compositions, J. of Comb. Math. and Comb. Computing, vol.33, pp.323-345, 2000.

T. Walsh, Gray codes for involutions, J. Comb. Math. and Comb. Computing, vol.36, pp.95-118, 2001.

T. Walsh, Generating Gray Codes in O(1) Worst-Case Time per Word, 4th Discrete Mathematics and Theoretical Computer Science Conference, pp.71-88, 2008.
DOI : 10.1007/3-540-45066-1_5

M. B. Wells, Generation of permutations by transposition, Mathematics of Computation, vol.15, issue.74, pp.192-195, 1961.
DOI : 10.1090/S0025-5718-1961-0127507-2

S. G. Williamson, Combinatorics for computer science, 1985.

H. S. Wilf, Generalized Gray codes, SIAM Conference on Discrete Mathematics, 1988.

H. S. Wilf, Combinatorial Algorithms: an Update, SIAM, 1989.
DOI : 10.1137/1.9781611970166

A. Williams, Loopless generation of multiset permutations by prefix shifts, Symposium on Discrete Algorithms (SODA), 2009.

A. Williams, Shift Gray Codes LIST OF FIGURES 5.1 (a) Algorithm GEN1, generating the list X n ; (b) Particular function OMEGA - X called by GEN1, and returning the value for ? X (s 1 s 2 . . . s k ), if X n is one of the sets: (i) S E n , (ii) A n, iii) R n , and (iv) S n . . . . . . . . . . . . . . . . . . . 42, 2009.

). Our-scheme-for-generating-p-n, that is, by restricting S E n subject to ? T , and then mapping S E n (T ) to P n (T ) by ?. . . . . . 100 LIST OF FIGURES 7.2 (a) Algorithm GENRSE, generating the list SE n (T ); (b) Particular function THETA X called by GENRSE, and returning the value for ? T (s n , k), if T is one of the sets of patterns: (i) T 1, iii) T 3 , and (iv) T (p) 4 . The initial call

G. Algorithm and P. Generating-the-list, The initial call is GENPAP(1, 0, 0, 0)

T. Graycodeness and P. , 112 IV APPENDICES #type_perm() #permutations (uncomment the desired output) else: if k==1:u=1 else: u=theta_XX(x,v) if drc%2==0: for i in

A. Sabri and V. Vajnovszki, Two Reflected Gray Code-Based Orders on Some Restricted Growth Sequences, The Computer Journal, vol.58, issue.5
DOI : 10.1093/comjnl/bxu018

A. Bernini, S. Bilotta, R. Pinzani, A. Sabri, and V. Vajnovszki, Gray code orders for $$q$$ q -ary words avoiding a given factor, Acta Informatica, vol.33, issue.5
DOI : 10.1007/s00236-015-0225-2

A. Bernini, S. Bilotta, R. Pinzani, A. Sabri, and V. Vajnovszki, Prefix partitioned gray codes for particular cross-bifix-free sets, Cryptography and Communications, vol.2731, issue.632, pp.359-369, 2014.
DOI : 10.1007/s12095-014-0105-6

A. Sabri and V. Vajnovszki, Restricted Steinhaus-Johnson-Trotter list, 9th International colloquium on graph theory and combinatorics (ICGT), p.30
URL : https://hal.archives-ouvertes.fr/hal-01202881