{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:06Z","timestamp":1720640646233},"reference-count":7,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s1571-0653(04)00484-6","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T09:34:04Z","timestamp":1113039244000},"page":"178-185","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Line Languages"],"prefix":"10.1016","volume":"12","author":[{"given":"K.","family":"Sasikala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Kalyani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.R.","family":"Dare","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.J.","family":"Abisha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(04)00484-6_BIB1","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-12920-0_30","article-title":"On extendibility of unavoidable sets","volume":"166","author":"Choffurt","year":"1984","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB2","first-page":"195","article-title":"Subword topology","volume":"47","author":"Dare","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/3-540-16042-6_16","article-title":"A Generalization of the Parikh Vector for finite and infinite finite words","volume":"206","author":"Dare","year":"1985","journal-title":"Lecture Notes in Computer Science"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB4","series-title":"Introduction to Formal Language Theory","author":"Harrison","year":"1978"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB5","first-page":"1","article-title":"Infinite words, infinite trees and infinite computations","volume":"109","author":"Nivat","year":"1979","journal-title":"Mathematical Centre Tracts"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0304-3975(85)90143-4","article-title":"On infinite words obtained by selective substitution grammars","volume":"39","author":"Siromoney","year":"1985","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0653(04)00484-6_BIB7","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/0304-3975(83)90049-X","article-title":"Infinite arrays and infinite computations","volume":"24","author":"Siromoney","year":"1983","journal-title":"Theoretical Computer science"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004846?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304004846?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,27]],"date-time":"2019-01-27T08:54:32Z","timestamp":1548579272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304004846"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":7,"alternative-id":["S1571065304004846"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00484-6","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}