{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T12:35:08Z","timestamp":1769517308490,"version":"3.49.0"},"reference-count":20,"publisher":"EDP Sciences","issue":"1","license":[{"start":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T00:00:00Z","timestamp":1464825600000},"content-version":"vor","delay-in-days":153,"URL":"https:\/\/www.edpsciences.org\/en\/authors\/copyright-and-licensing"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"accepted":{"date-parts":[[2016,3,24]]},"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>Cross-bifix-free sets are sets of words such that no proper prefix of any word is a proper suffix of any other word. In this paper, we introduce a general constructive method for the sets of cross-bifix-free<jats:italic>q<\/jats:italic>-ary words of fixed length. It enables us to determine a cross-bifix-free words subset which has the property to be non-expandable.<\/jats:p>","DOI":"10.1051\/ita\/2016008","type":"journal-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T06:32:10Z","timestamp":1464849130000},"page":"81-91","source":"Crossref","is-referenced-by-count":10,"title":["Cross-bifix-free sets generation<i>via<\/i>Motzkin paths"],"prefix":"10.1051","volume":"50","author":[{"given":"Elena","family":"Barcucci","sequence":"first","affiliation":[]},{"given":"Stefano","family":"Bilotta","sequence":"additional","affiliation":[]},{"given":"Elisa","family":"Pergola","sequence":"additional","affiliation":[]},{"given":"Renzo","family":"Pinzani","sequence":"additional","affiliation":[]},{"given":"Jonathan","family":"Succi","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2016,6,2]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1006\/eujc.1998.0235","volume":"19","author":"Aigner","year":"1998","journal-title":"Eur. J. Combin."},{"key":"R2","unstructured":"D. Bajic, On construction of cross-bifix-free kernel sets, in Proc. of Conference on 2nd MCM COST 2100 (2007) TD(07)237."},{"key":"R3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s12095-013-0088-8","volume":"6","author":"Bajic","year":"2014","journal-title":"Cryptogr. Commun."},{"key":"R4","doi-asserted-by":"crossref","unstructured":"D. Bajic and J. Stojanovic, Distributed sequences and search process, in Proc. of IEEE International Conference on Communications ICC 2004 (2004) 514\u2013518.","DOI":"10.1109\/ICC.2004.1312542"},{"key":"R5","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/BFb0030840","volume":"959","author":"Barcucci","year":"1995","journal-title":"Lect. Notes Comput. Sci."},{"key":"R6","unstructured":"R.H. Barker, Group Synchronizing of Binary Digital Systems, Communication theory, London, Butterworth (1953) 273\u2013287."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"J. Berstel, D. Perrin and C. Reutenauer, Codes and Automata. Encycl. Math. Appl. Cambridge University Press (2009).","DOI":"10.1017\/CBO9781139195768"},{"key":"R8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00236-013-0176-4","volume":"50","author":"Bilotta","year":"2013","journal-title":"Acta Inform."},{"key":"R9","doi-asserted-by":"crossref","first-page":"4058","DOI":"10.1109\/TIT.2012.2189479","volume":"58","author":"Bilotta","year":"2012","journal-title":"IEEE Trans. Inform. Theory"},{"key":"R10","doi-asserted-by":"crossref","first-page":"4890","DOI":"10.1109\/TIT.2015.2456634","volume":"61","author":"Blackburn","year":"2015","journal-title":"IEEE Trans. Inform. Theory"},{"key":"R11","doi-asserted-by":"crossref","first-page":"4668","DOI":"10.1109\/TIT.2013.2252952","volume":"59","author":"Chee","year":"2013","journal-title":"IEEE Trans. Inform. Theory"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"M. Crochemore, C. Hancart and T. Lecroq, Algorithms on Strings. Cambridge University Press (2007).","DOI":"10.1017\/CBO9780511546853"},{"key":"R13","doi-asserted-by":"crossref","first-page":"2127","DOI":"10.1109\/26.891223","volume":"48","author":"De Lind Van Wijngaarden","year":"2000","journal-title":"IEEE Trans. Commun."},{"key":"R14","first-page":"355","volume":"6","author":"Levenshtein","year":"1970","journal-title":"Probl. Inf. Transm."},{"key":"R15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1080\/00150517.1985.12429796","volume":"23","author":"Levesque","year":"1985","journal-title":"Fibonacci Quart."},{"key":"R16","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1049\/el:19750391","volume":"11","author":"Lindner","year":"1975","journal-title":"Electron. Lett."},{"key":"R17","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1109\/TIT.1973.1055064","volume":"29","author":"Nielsen","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"R18","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"29","author":"Nielsen","year":"1973","journal-title":"IEEE Trans. Inform. Theory"},{"key":"R19","first-page":"04","volume":"7","author":"Sapounakis","year":"2004","journal-title":"J. Integer Seq."},{"key":"R20","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/TCOM.1980.1094813","volume":"20","author":"Scholtz","year":"1980","journal-title":"IEEE Trans. Commun."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016008\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T20:23:17Z","timestamp":1748982197000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2016008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":20,"journal-issue":{"issue":"1"},"alternative-id":["ita160026"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2016008","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}