{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T04:45:14Z","timestamp":1648788314514},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5433,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1016\/s0304-3975(97)00072-8","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T04:26:12Z","timestamp":1049516772000},"page":"145-181","source":"Crossref","is-referenced-by-count":5,"title":["Periodicities on trees"],"prefix":"10.1016","volume":"205","author":[{"given":"Dora","family":"Giammarresi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sabrina","family":"Mantaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Mignosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio","family":"Restivo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00072-8_BIB1","series-title":"The Design and the Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB2","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB3","article-title":"Counting prime trees","author":"Castelli","year":"1996","journal-title":"Dipartimento di Matematica ed Applicazioni dell'Universit\u00e1 di Palermo No. 18"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB4","first-page":"109","article-title":"Uniqueness theorem for periodic functions","volume":"16","author":"Fine","year":"1965"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB5","first-page":"473","article-title":"A periodicity theorem for trees","volume":"vol. A-51","author":"Giammarresi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB6","series-title":"Proc. Workshop Semigroups, Automata and Languages","first-page":"125","article-title":"Congruences, automata and periodicities","author":"Giammarresi","year":"1995"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB7","series-title":"Proc. CAAP 94","first-page":"130","article-title":"Generalizations of the periodicity Theorem of Fine and Wilf","volume":"vol. 787","author":"Giancarlo","year":"1994"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB8","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","article-title":"Periods in strings","volume":"A 30","author":"Guibas","year":"1981","journal-title":"J. Combin. Theory Ser."},{"key":"10.1016\/S0304-3975(97)00072-8_BIB9","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB10","series-title":"Languages and Computation","article-title":"Introduction to Automata Theory","author":"Hopcroft","year":"1979"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB11","volume":"vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB12","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB13","series-title":"Proc. MFCS'96","first-page":"443","article-title":"Equations on trees","volume":"vol. 1113","author":"Mantaci","year":"1996"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB14","series-title":"Tree Automata and Languages","first-page":"1","article-title":"Binary tree codes","author":"Nivat","year":"1992"},{"key":"10.1016\/S0304-3975(97)00072-8_BIB15","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0304-3975(92)90259-I","article-title":"Lyndon trees","volume":"106","author":"Subramanian","year":"1992","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:02:00Z","timestamp":1555419720000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["S0304397597000728"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00072-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}