{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T20:01:48Z","timestamp":1708545708659},"reference-count":12,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"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":5737,"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":[[1997,11]]},"DOI":"10.1016\/s0304-3975(97)00097-2","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T21:37:28Z","timestamp":1051738648000},"page":"231-240","source":"Crossref","is-referenced-by-count":5,"title":["Structure of 3-infix-outfix maximal codes"],"prefix":"10.1016","volume":"188","author":[{"family":"Dong Yang Long","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ma","family":"Jian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Duanning","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00097-2_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0304-3975(97)00097-2_BIB2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0166-218X(92)90284-H","article-title":"Anti-commutative languages and n-codes","volume":"24","author":"Ito","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB3","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207168908803768","article-title":"N-prefix-suffix languages","volume":"30","author":"Ito","year":"1989","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB4","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/0022-0000(91)90026-2","article-title":"Outfix and infix codes and related classes of languages","volume":"43","author":"Ito","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(92)90341-C","article-title":"Languages whose n-element subsets are codes","volume":"94","author":"Ito","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB6","first-page":"511","article-title":"Codes","author":"J\u00fcrgensen","year":"1996"},{"key":"10.1016\/S0304-3975(97)00097-2_BIB7","first-page":"38","article-title":"On the structure of some group codes","volume":"45","author":"Long","year":"1992"},{"key":"10.1016\/S0304-3975(97)00097-2_BIB8","series-title":"Proc. Conf. on Ordered Structures and Algebra of Computer Languages, World Scientific","first-page":"81","article-title":"On two infinite hierarchies of prefix codes","author":"Long","year":"1993"},{"key":"10.1016\/S0304-3975(97)00097-2_BIB9","first-page":"584","article-title":"N-infix-outfix codes","volume":"39","author":"Long","year":"1994","journal-title":"Chinese Sci. Bull."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0304-3975(95)00238-3","article-title":"On group codes","volume":"163","author":"Long","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00097-2_BIB11","series-title":"Free Monoids and Languages","author":"Shyr","year":"1991"},{"key":"10.1016\/S0304-3975(97)00097-2_BIB12","series-title":"S\u00e9minaire Dubriel-Pisot","first-page":"862","article-title":"Une Th\u00e9orie Alg\u00e9brique de Codage","volume":"242","author":"Sch\u00fctzenberger","year":"1955"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000972?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597000972?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:59:38Z","timestamp":1555405178000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597000972"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":12,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0304397597000972"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00097-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}