{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:38:57Z","timestamp":1720201137769},"reference-count":13,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":10424,"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":[[1985]]},"DOI":"10.1016\/0304-3975(85)90143-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"281-295","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["On infinite words obtained by selective substitution grammars"],"prefix":"10.1016","volume":"39","author":[{"given":"Rani","family":"Siromoney","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.Rajkumar","family":"Dare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(85)90143-4_BIB1","series-title":"TW-memorandum 99","article-title":"Infinite chains of Hyper-AFL","author":"Asveld","year":"1975"},{"key":"10.1016\/0304-3975(85)90143-4_BIB2","first-page":"221","article-title":"Uniformly growing k-th power-free homomorphisms","volume":"18","author":"Brandenburg","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90143-4_BIB3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0022-0000(77)80004-4","article-title":"Theory of \u03c9-languages, Parts I and II","volume":"15","author":"Cohen","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(85)90143-4_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0304-3975(82)90013-5","article-title":"On infinite words obtained by iterating morphisms","volume":"19","author":"Culik","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90143-4_BIB5","volume":"Vol. A","author":"Eilenberg","year":"1974"},{"key":"10.1016\/0304-3975(85)90143-4_BIB6","first-page":"12","article-title":"A note on infinite words obtained by iterating morphisms","volume":"18","author":"Harju","year":"1982","journal-title":"Bull. of EATCS"},{"key":"10.1016\/0304-3975(85)90143-4_BIB7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0304-3975(82)90080-9","article-title":"Some remarks on non-algebraic adherences","volume":"21","author":"Istrail","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(85)90143-4_BIB8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0019-9958(81)90657-4","article-title":"Sequential, continuous and parallel grammars","volume":"48","author":"Kleijn","year":"1981","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90143-4_BIB9","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0019-9958(76)90415-0","article-title":"On \u03c9-sets associated with context-free languages","volume":"31","author":"Linna","year":"1976","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(85)90143-4_BIB10","first-page":"1","article-title":"Infinite words, infinite trees and infinite computations","volume":"109","author":"Nivat","year":"1979"},{"issue":"9","key":"10.1016\/0304-3975(85)90143-4_BIB11","first-page":"455","article-title":"Selective substitution grammars (towards a framework for rewriting systems), Part I: Definition and examples","volume":"13","author":"Rozenberg","year":"1977","journal-title":"EIK"},{"key":"10.1016\/0304-3975(85)90143-4_BIB12","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/0304-3975(85)90143-4_BIB13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0020-0255(81)90012-8","article-title":"Selective substitution array grammars","volume":"25","author":"Siromoney","year":"1981","journal-title":"Information Sciences"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901434?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585901434?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:51Z","timestamp":1553172771000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585901434"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":13,"alternative-id":["0304397585901434"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90143-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}