{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:15:37Z","timestamp":1648739737322},"reference-count":21,"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:2007060","type":"journal-article","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T09:08:06Z","timestamp":1199351286000},"page":"729-746","source":"Crossref","is-referenced-by-count":0,"title":["Look and Say Fibonacci"],"prefix":"10.1051","volume":"42","author":[{"given":"Patrice","family":"S\u00e9\u00e9bold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,1,4]]},"reference":[{"key":"R1","unstructured":"J.-P. Allouche and J. Shallit,Automatic sequences: theory, applications, generalizations. Cambridge University Press (2003)."},{"key":"R2","first-page":"769","volume":"44","author":"Arshon","year":"1937","journal-title":"Mat. Sb."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"J. Berstel, Mots sans carr\u00e9 et morphismes it\u00e9r\u00e9s.Discrete Math.29(1980). 235\u2013244.","DOI":"10.1016\/0012-365X(80)90151-X"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"J. Berstel, Fibonacci words \u2013 a survey, inThe Book of\u00a0L, edited by G. Rozenberg, A. Salomaa. Springer-Verlag (1986) 13\u201327.","DOI":"10.1007\/978-3-642-95486-3_2"},{"key":"R5","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/3-540-57182-5_20","volume":"711","author":"Berstel","year":"1993","journal-title":"Lect. Notes Comput. Sci."},{"key":"R6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1051\/ita\/1994283-402551","volume":"28","author":"Berstel","year":"1994","journal-title":"RAIRO-Theor. Inf. Appl."},{"key":"R7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/j.tcs.2005.12.003","volume":"352","author":"Brlek","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"R8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"Cobham","year":"1972","journal-title":"Math. Syst. Theory"},{"key":"R9","unstructured":"J.H. Conway, The weird and wonderful chemistry of audioactive decay, inOpen problems in communication and computation, edited by T.M. Cover, B. Gopinath. Springer-Verlag, New-York (1987) 173\u2013188. See alsoEureka46(1986) 5\u201318."},{"key":"R10","unstructured":"B. Germain-Bonne, \u00c0 propos d'une it\u00e9ration sur cha\u00eenes de caract\u00e8res num\u00e9riques.Laboratoire d'Analyse Num\u00e9rique et d'Optimisation.Universit\u00e9 Lille 1, Research Report ANO293(1993)."},{"key":"R11","unstructured":"B. Germain-Bonne, Cha\u00eenes alphanum\u00e9riques ; cycles et points fixes.Laboratoire d'Analyse Num\u00e9rique et d'Optimisation.Universit\u00e9 Lille 1, Research Report ANO301(1993)."},{"key":"R12","unstructured":"B. Germain-Bonne, Mots autodescriptifs et co-descriptifs.Laboratoire d'Analyse Num\u00e9rique et d'Optimisation.Universit\u00e9 Lille 1, Research Report ANO332(1994)."},{"key":"R13","doi-asserted-by":"crossref","unstructured":"M. Lothaire,Combinatorics on Words,Encyclopedia of Mathematics and Applications, Vol.17. Addison-Wesley, Reading, Mass. (1983). Reprinted in theCambridge Mathematical Library, Cambridge University Press (1997).","DOI":"10.1017\/CBO9780511566097"},{"key":"R14","doi-asserted-by":"crossref","unstructured":"M. Lothaire,Algebraic Combinatorics on Words,Encyclopedia of Mathematics and its Applications, Vol.90. Cambridge University Press (2002).","DOI":"10.1017\/CBO9781107326019"},{"key":"R15","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0012-365X(99)00123-5","volume":"210","author":"Melan\u00e7on","year":"2000","journal-title":"Discrete Math."},{"key":"R16","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/BF00289415","volume":"20","author":"Pansiot","year":"1983","journal-title":"Acta Informatica"},{"key":"R17","first-page":"89","volume":"9","author":"Richomme","year":"2007","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"R18","unstructured":"Handbook of Formal Languages, Vol.1, edited by G. Rozenberg, A. Salomaa. Springer (1997)."},{"key":"R19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/S0304-3975(97)00159-X","volume":"195","author":"S\u00e9\u00e9bold","year":"1998","journal-title":"Theor. Comput. Sci."},{"key":"R20","first-page":"579","volume":"7","author":"S\u00e9\u00e9bold","year":"2002","journal-title":"J. Autom. Lang. Comb."},{"key":"R21","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(94)90016-7","volume":"50","author":"Siromoney","year":"1994","journal-title":"Inform. Process Lett."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007060\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T13:44:36Z","timestamp":1557150276000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2007060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,4]]},"references-count":21,"journal-issue":{"issue":"4"},"alternative-id":["ita07060"],"URL":"https:\/\/doi.org\/10.1051\/ita:2007060","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1,4]]}}}