{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T02:22:48Z","timestamp":1772245368504,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7-8","license":[{"start":{"date-parts":[[2015,3,7]],"date-time":"2015-03-07T00:00:00Z","timestamp":1425686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2015,11]]},"DOI":"10.1007\/s00236-015-0225-2","type":"journal-article","created":{"date-parts":[[2015,3,6]],"date-time":"2015-03-06T07:25:56Z","timestamp":1425626756000},"page":"573-592","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Gray code orders for $$q$$ q -ary words avoiding a given factor"],"prefix":"10.1007","volume":"52","author":[{"given":"A.","family":"Bernini","sequence":"first","affiliation":[]},{"given":"S.","family":"Bilotta","sequence":"additional","affiliation":[]},{"given":"R.","family":"Pinzani","sequence":"additional","affiliation":[]},{"given":"A.","family":"Sabri","sequence":"additional","affiliation":[]},{"given":"V.","family":"Vajnovszki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,7]]},"reference":[{"key":"225_CR1","unstructured":"Bernini, A., Bilotta, S., Pinzani, R., Vajnovszki, V.: Two Gray codes for $$q$$ q -ary $$k$$ k -generalized Fibonacci strings. In: ICTCS13, Palermo-Italy, 9\u201311 Sept (2013)"},{"key":"225_CR2","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A construction for a class of binary words avoiding $$1^j0^i$$ 1 j 0 i . Pu.M.A 23(2), 81\u2013102 (2012)"},{"key":"225_CR3","first-page":"35","volume":"117","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Merlini, D., Pergola, E., Pinzani, R.: Pattern $$1^{j+1}0^j$$ 1 j + 1 0 j avoiding binary words. Fund. Inf. 117, 35\u201355 (2012)","journal-title":"Fund. Inf."},{"key":"225_CR4","doi-asserted-by":"crossref","unstructured":"Er, M.C.: On generating the $$N$$ N -ary reflected Gray code. IEEE Trans. Comput. 33(8), 739\u2013741 (1984)","DOI":"10.1109\/TC.1984.5009360"},{"key":"225_CR5","unstructured":"Gray, F.: Pulse code communication. US Patent 2632058 (1953)"},{"issue":"1","key":"225_CR6","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30(1), 19\u201342 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"key":"225_CR7","doi-asserted-by":"crossref","unstructured":"Heubach, S., Mansour, T.: Combinatorics of Compositions and Words. Chapman and Hall\/CRC, Taylor & Francis Group, Boca Raton, London, New York (2009)","DOI":"10.1201\/9781420072686"},{"key":"225_CR8","doi-asserted-by":"crossref","unstructured":"Joichi, J., White, D.E., Williamson, S.G.: Combinatorial Gray codes. SIAM J. Comput. 9, 130\u2013141 (1980)","DOI":"10.1137\/0209013"},{"key":"225_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6, 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"225_CR10","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.ipl.2008.11.007","volume":"109","author":"Y Li","year":"2009","unstructured":"Li, Y., Sawada, J.: Gray codes for reflectable languages. Inf. Process. Lett. 109(5), 296\u2013300 (2009)","journal-title":"Inf. Process. Lett."},{"key":"225_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words. Cambridge University Press, New York (2005)"},{"key":"225_CR12","doi-asserted-by":"crossref","unstructured":"Sabri, A., Vajnovszki, V.: Two reflected Gray code based orders on some restricted growth sequences. Comput. J. (to appear)","DOI":"10.1093\/comjnl\/bxu018"},{"key":"225_CR13","doi-asserted-by":"crossref","unstructured":"Squire, M.: Gray codes for $$A$$ A -free strings. Electr. J. Comb. 3(paper R17) (1996)","DOI":"10.37236\/1241"},{"key":"225_CR14","unstructured":"Ruskey, F.: Combinatorial Generation (book in preparation)"},{"key":"225_CR15","doi-asserted-by":"crossref","unstructured":"Vajnovszki, V.: A loopless generation of bitstrings without $$p$$ p consecutive ones. In: Calude, C.S., Dinneen, M.J., Sburlan, S. (eds.) Combinatorics, Computability and Logic. Discrete Mathematics and Theoretical Computer Science, pp. 227\u2013240. Springer, London (2001)","DOI":"10.1007\/978-1-4471-0717-0_19"},{"key":"225_CR16","doi-asserted-by":"crossref","unstructured":"Vajnovszki, V., Vernay, R.: Restricted compositions and permutations: from old to new Gray codes. Inf. Process. Lett. 111(13), 650\u2013655 (2011)","DOI":"10.1016\/j.ipl.2011.03.022"},{"key":"225_CR17","unstructured":"Vajnovszki, V.: http:\/\/v.vincent.u-bourgogne.fr\/0ABS\/publi.html"},{"key":"225_CR18","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Generating Gray codes in $$O(1)$$ O ( 1 ) worst-case time per word. In: 4th Discrete Mathematics and Theoretical Computer Science Conference, Dijon-France, 7\u201312 July 2003 (LNCS), vol. 2731, pp. 73\u201388 (2003)","DOI":"10.1007\/3-540-45066-1_5"},{"key":"225_CR19","first-page":"323","volume":"33","author":"T Walsh","year":"2000","unstructured":"Walsh, T.: Loop-free sequencing of bounded integer compositions. J. Comb. Math. Comb. Comput. 33, 323\u2013345 (2000)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"225_CR20","volume-title":"Combinatorics for Computer Science","author":"SG Williamson","year":"1985","unstructured":"Williamson, S.G.: Combinatorics for Computer Science. Computer Science Press, Rockville (1985)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0225-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-015-0225-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-015-0225-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,30]],"date-time":"2020-08-30T15:32:21Z","timestamp":1598801541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-015-0225-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,7]]},"references-count":20,"journal-issue":{"issue":"7-8","published-print":{"date-parts":[[2015,11]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s00236-015-0225-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,7]]}}}