{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:50:43Z","timestamp":1755035443676},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T00:00:00Z","timestamp":1359072000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s00236-013-0176-4","type":"journal-article","created":{"date-parts":[[2013,1,24]],"date-time":"2013-01-24T13:35:56Z","timestamp":1359034556000},"page":"157-173","source":"Crossref","is-referenced-by-count":10,"title":["Avoiding cross-bifix-free binary words"],"prefix":"10.1007","volume":"50","author":[{"given":"Stefano","family":"Bilotta","sequence":"first","affiliation":[]},{"given":"Elisabetta","family":"Grazzini","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,1,25]]},"reference":[{"issue":"2","key":"176_CR1","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/inco.2002.3143","volume":"174","author":"A Apostolico","year":"2002","unstructured":"Apostolico, A., Atallah, M.: Compact recognizers of episode sequences. Inf. Comput. 174(2), 180\u2013192 (2002)","journal-title":"Inf. Comput."},{"issue":"8","key":"176_CR2","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1007\/s00236-004-0139-x","volume":"40","author":"S Bacchelli","year":"2004","unstructured":"Bacchelli, S., Barcucci, E., Grazzini, E., Pergola, E.: Exhaustive generation of combinatorial objects by ECO. Acta Inform. 40(8), 585\u2013602 (2004)","journal-title":"Acta Inform."},{"key":"176_CR3","unstructured":"Bajic, D.: On Construction of Cross-Bifix-Free Kernel Sets, 2nd MCM COST 2100, TD(07) 237. Lisbon, Portugal (2007)"},{"issue":"8","key":"176_CR4","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1049\/el:19950460","volume":"31","author":"D Bajic","year":"1995","unstructured":"Bajic, D., Drajic, D.: Duration of search for a fixed pattern in random data: distribution function and variance. Electron. lett. 31(8), 631\u2013632 (1995)","journal-title":"Electron. lett."},{"key":"176_CR5","doi-asserted-by":"crossref","unstructured":"Bajic, D., Stojanovic, J.: Distributed sequences and search process. In: IEEE International Conference on Communications, ICC2004 Paris, pp. 514\u2013518 (2004)","DOI":"10.1109\/ICC.2004.1312542"},{"key":"176_CR6","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(01)00250-3","volume":"246","author":"C Banderier","year":"2002","unstructured":"Banderier, C., Bousquet-M\u00e9lou, M., Denise, A., Flajolet, P., Gardy, D., Gouyou-Beauchamps, D.: Generating functions for generating trees. Discret. Math. 246, 29\u201355 (2002)","journal-title":"Discret. Math."},{"key":"176_CR7","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1080\/10236199908808200","volume":"5","author":"E Barcucci","year":"1999","unstructured":"Barcucci, E., Del Lungo, A., Pergola, E., Pinzani, R.: ECO: a methodology for the enumeration of combinatorial objects. J. Differ. Equ. Appl. 5, 435\u2013490 (1999)","journal-title":"J. Differ. Equ. Appl."},{"issue":"5","key":"176_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s00236-007-0053-0","volume":"44","author":"A Bernini","year":"2007","unstructured":"Bernini, A., Grazzini, E., Pergola, E., Pinzani, R.: A general exhaustive generation algorithm for gray structures. Acta Inform. 44(5), 361\u2013376 (2007)","journal-title":"Acta Inform."},{"issue":"1\u20134","key":"176_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/FI-2012-687","volume":"177","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Merlini, D., Pergola, E., Pinzani, R.: Pattern $$1^{j+1}0^j$$ avoiding binary words. Fundam. Inform. 177(1\u20134), 35\u201355 (2012)","journal-title":"Fundam. Inform."},{"issue":"6","key":"176_CR10","doi-asserted-by":"crossref","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"S Bilotta","year":"2012","unstructured":"Bilotta, S., Pergola, E., Pinzani, R.: A new approach to cross-bifix-free sets. IEEE Trans. Inf. Theory 58(6), 4058\u20134063 (2012)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"176_CR11","doi-asserted-by":"crossref","unstructured":"Corteel, S.: S\u00e9ries g\u00e9n\u00e9ratrices exponentielles pour les ECO-syst\u00e8mes sign\u00e9s. In: Proceedings of the 12th International Conference on Formal Power Series and Algebraic Combinatorics, Moscow (2000)","DOI":"10.1007\/978-3-662-04166-6_64"},{"key":"176_CR12","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(02)00868-3","volume":"271","author":"L Ferrari","year":"2003","unstructured":"Ferrari, L., Pergola, E., Pinzani, R., Rinaldi, S.: Jumping succession rules and their generating functions. Discret. Math. 271, 29\u201350 (2003)","journal-title":"Discret. Math."},{"key":"176_CR13","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0024-3795(01)00584-5","volume":"348","author":"L Ferrari","year":"2002","unstructured":"Ferrari, L., Pinzani, R.: A linear operator approach to succession rules. Linear Algebra Appl. 348, 231\u2013246 (2002)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"176_CR14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1145\/1120582.1120586","volume":"53","author":"P Flajolet","year":"2006","unstructured":"Flajolet, P., Szpankowski, W., Valle, B.: Hidden word statistics. J. ACM 53(1), 147\u2013183 (2006)","journal-title":"J. ACM"},{"key":"176_CR15","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF00531434","volume":"53","author":"LJ Guibas","year":"1980","unstructured":"Guibas, L.J., Odlyzko, M.: Long repetitive patterns in random sequences. Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie 53, 241\u2013262 (1980)","journal-title":"Zeitschrift f\u00fcr Wahrscheinlichkeitstheorie"},{"key":"176_CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, M.: String overlaps, pattern matching, and nontransitive games. J. Comb. Theory Ser. A 30, 183\u2013208 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"key":"176_CR17","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/j.tcs.2005.03.040","volume":"340","author":"T Harju","year":"2005","unstructured":"Harju, T., Nowotka, D.: Counting bordered and primitive words with a fixed weight. Theor. Comput. Sci. 340, 273\u2013279 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"176_CR18","unstructured":"Kim, K.H., Putcha, M.S., Roush, F.W.: Some combinatorial properties of free semigroups. J. Lond. Math. Soc. 16(2), 397\u2013402 (1977)"},{"key":"176_CR19","unstructured":"Kumar, S., Spafford, E.H.: A pattern matching model for misuse intrusion detection. In: Computer Security, pp. 11\u201321 (1994)"},{"key":"176_CR20","doi-asserted-by":"crossref","unstructured":"Merlini, D., Sprugnoli, R., Verri, M.C.: An Algebra for proper generating tree, In: Algorithms, Trees, Combinatorics and Probabilities, Trends in Mathematics, Mathematics and Computer Science, pp. 127\u2013139 (2000)","DOI":"10.1007\/978-3-0348-8405-1_11"},{"key":"176_CR21","doi-asserted-by":"crossref","unstructured":"Nielsen, P.T.: On the expected duration of a search for a fixed pattern in random data. IEEE Trans. Inform. Theory, IT-29, 702\u2013704 (1973)","DOI":"10.1109\/TIT.1973.1055064"},{"key":"176_CR22","doi-asserted-by":"crossref","unstructured":"Nielsen, P.T.: A Note on Bifix-free sequences. IEEE Trans. Inform. Theory, IT-29, 704\u2013706 (1973)","DOI":"10.1109\/TIT.1973.1055065"},{"key":"176_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1006\/mben.2000.0151","volume":"2","author":"I Rigoutsos","year":"2000","unstructured":"Rigoutsos, I., Floratos, A., Parida, L., Gao, Y., Platt, D.: The emergence of pattern discovery techniques in computational biology. Metab. Eng. 2, 159\u2013177 (2000)","journal-title":"Metab. Eng."},{"key":"176_CR24","volume-title":"An Introduction to the Analysis of Algorithms","author":"R Sedgewick","year":"1995","unstructured":"Sedgewick, R., Flajolet, P.: An Introduction to the Analysis of Algorithms. Chapman-Hall, London (1995)"},{"key":"176_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4899-6846-3","volume-title":"Introduction to Computational Biology","author":"M Waterman","year":"1995","unstructured":"Waterman, M.: Introduction to Computational Biology. Addison-Wesley, Reading (1995)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0176-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-013-0176-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-013-0176-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T04:44:33Z","timestamp":1595306673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-013-0176-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,25]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["176"],"URL":"https:\/\/doi.org\/10.1007\/s00236-013-0176-4","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,25]]}}}