{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:37:22Z","timestamp":1720201042603},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0304-3975(86)90086-1","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T10:09:04Z","timestamp":1051265344000},"page":"101-108","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Regularity of sets of initial strings of periodic D0L-systems"],"prefix":"10.1016","volume":"48","author":[{"given":"Tom","family":"Head","sequence":"first","affiliation":[]},{"given":"Barbara","family":"Lando","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(86)90086-1_BIB1","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0304-3975(86)90086-1_BIB2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1051\/ita\/1986200100471","article-title":"On the periodicity of morphisms on free monoids","volume":"20","author":"Harju","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90086-1_BIB3","series-title":"The Book of L","article-title":"Fixed and stationary \u03c9-words and \u03c9-languages","author":"Head","year":"1986"},{"issue":"1","key":"10.1016\/0304-3975(86)90086-1_BIB4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(86)90023-X","article-title":"Periodic D0L-Languages","volume":"46","author":"Head","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(86)90086-1_BIB5","series-title":"Combinatorics on Words","author":"Lothaire","year":"1983"},{"key":"10.1016\/0304-3975(86)90086-1_BIB6","series-title":"Counter-Free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/0304-3975(86)90086-1_BIB7","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1051\/ita\/1986200100431","article-title":"Decidability of periodicity for infinite words","volume":"20","author":"Pansiot","year":"1986","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/0304-3975(86)90086-1_BIB8","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/0304-3975(86)90086-1_BIB9","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900861?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397586900861?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T20:53:58Z","timestamp":1553201638000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397586900861"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":9,"alternative-id":["0304397586900861"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(86)90086-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}