{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:19:53Z","timestamp":1773080393869,"version":"3.50.1"},"reference-count":22,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1051\/ita:2008002","type":"journal-article","created":{"date-parts":[[2008,1,21]],"date-time":"2008-01-21T15:38:11Z","timestamp":1200929891000},"page":"717-728","source":"Crossref","is-referenced-by-count":8,"title":["A hierarchy for circular codes"],"prefix":"10.1051","volume":"42","author":[{"given":"Giuseppe","family":"Pirillo","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2008,1,22]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1006\/jtbi.1996.0142","volume":"182","author":"Arqu\u00e8s","year":"1996","journal-title":"J. Theor. Biol."},{"key":"R2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1006\/jtbi.1997.0513","volume":"189","author":"Arqu\u00e8s","year":"1997","journal-title":"J. Theor. Biol."},{"key":"R3","unstructured":"J. Berstel,Mots de Fibonacci. S\u00e9minaire d'informatique th\u00e9orique. LITP, Paris (1980\u201381) 57\u201378."},{"key":"R4","unstructured":"J. Berstel and D. Perrin,Theory of codes. Academic Press (1985)."},{"key":"R5","unstructured":"J. Berstel and P. Seebold,Sturmian words, in Algebraic Combinatorics on words, edited by M. Lothaire. Cambridge University Press (2002)."},{"key":"R6","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1073\/pnas.43.5.416","volume":"43","author":"Crick","year":"1957","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"R7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0020-0190(81)90099-5","volume":"12","author":"de Luca","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"R8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0304-3975(96)00310-6","volume":"183","author":"de Luca","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0020-0190(95)00080-V","volume":"55","author":"Droubay","year":"1995","journal-title":"Inform. Process Lett."},{"key":"R10","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0020-0190(97)00080-X","volume":"62","author":"Justin","year":"1997","journal-title":"Inform. Process. Lett."},{"key":"R11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0166-218X(83)90002-1","volume":"5","author":"Karhum\u00e4ki","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"R12","unstructured":"D.E. Knuth,The Art of Computer Programming. Addison\u2013Wesley, Reading, Mass. (1968)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"Knuth","year":"1977","journal-title":"SIAM J. Comput."},{"key":"R14","unstructured":"M. Lothaire,Combinatorics on words. Addison-Wesley (1983)."},{"key":"R15","unstructured":"C.J. Michel, G. Pirillo and M.A. Pirillo, Varieties of comma-free codes.Comput. Math. Appl.(in press)."},{"key":"R16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1051\/ita\/1992260301991","volume":"26","author":"Mignosi","year":"1992","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"G. Pirillo, Infinite words and biprefix codes.Inform. Process Lett.50293\u2013295 (1994).","DOI":"10.1016\/0020-0190(94)00053-0"},{"key":"R18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0012-365X(94)00236-C","volume":"173","author":"Pirillo","year":"1997","journal-title":"Discrete Math."},{"key":"R19","first-page":"361","volume":"6","author":"Pirillo","year":"1999","journal-title":"Algebra Colloquium"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"G. Pirillo, A characterization for a set of trinucleotides to be a circular code, InDeterminism, Holism, and Complexity, edited by C. Pellegrini, P. Cerrai, P. Freguglia, V. Benci and G. Israel. Kluwer (2003).","DOI":"10.1007\/978-1-4757-4947-2_22"},{"key":"R21","first-page":"97","volume":"98","author":"Pirillo","year":"2005","journal-title":"Biology Forum"},{"key":"R22","unstructured":"P.P. S\u00e9\u00e9bold,Propri\u00e9t\u00e9s combinatoires des mots infinis engendr\u00e9s par certains morphismes. PhD. thesis, L.I.T.P., Paris. (1985)."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008002\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,15]],"date-time":"2023-05-15T23:18:50Z","timestamp":1684192730000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2008002"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,22]]},"references-count":22,"journal-issue":{"issue":"4"},"alternative-id":["ita07059"],"URL":"https:\/\/doi.org\/10.1051\/ita:2008002","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,22]]}}}