{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,21]],"date-time":"2024-02-21T20:03:22Z","timestamp":1708545802100},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":4460,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0166-218x(00)00260-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:49:17Z","timestamp":1027612157000},"page":"237-252","source":"Crossref","is-referenced-by-count":2,"title":["k-p-Infix codes and semaphore codes"],"prefix":"10.1016","volume":"109","author":[{"given":"Dongyang","family":"Long","sequence":"first","affiliation":[]},{"given":"Weijia","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Duanning","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00260-2_BIB1","series-title":"Theory of Codes","author":"Berstel","year":"1985"},{"key":"10.1016\/S0166-218X(00)00260-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\/S0166-218X(00)00260-2_BIB3","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\/S0166-218X(00)00260-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\/S0166-218X(00)00260-2_BIB5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1080\/00207168908803768","article-title":"n-Prefix\u2013Suffix languages","volume":"30","author":"Ito","year":"1989","journal-title":"Internat. J. Comput. Math."},{"key":"10.1016\/S0166-218X(00)00260-2_BIB6","series-title":"Handbook of Formal Languages","first-page":"511","article-title":"Codes","author":"J\u00fcrgensen","year":"1997"},{"key":"10.1016\/S0166-218X(00)00260-2_BIB7","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/BF03025747","article-title":"On the structure of some group codes","volume":"45","author":"Long","year":"1992","journal-title":"Semigroup Forum"},{"key":"10.1016\/S0166-218X(00)00260-2_BIB8","series-title":"Proceedings of the Conf. on Ordered Structures and Algebra of Computer Languages","first-page":"81","article-title":"On two infinite hierarchies of prefix codes","author":"Long","year":"1993"},{"key":"10.1016\/S0166-218X(00)00260-2_BIB9","doi-asserted-by":"crossref","unstructured":"D.Y. Long, n-Infix\u2013outfix codes, Chinese Sci. Bull. 39 (1994) 584\u2013586 (in Chinese).","DOI":"10.1360\/csb1994-39-7-584"},{"key":"10.1016\/S0166-218X(00)00260-2_BIB10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/S0304-3975(97)00097-2","article-title":"Structure of 3-infix\u2013outfix maximal codes","volume":"188","author":"Long","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0166-218X(00)00260-2_BIB11","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\/S0166-218X(00)00260-2_BIB12","first-page":"33","article-title":"k-Bifix codes","volume":"15","author":"Long","year":"1994","journal-title":"Riv. Mat. Pura Appl."},{"key":"10.1016\/S0166-218X(00)00260-2_BIB13","unstructured":"D.Y. Long, k-Outfix codes, Chinese Ann. Math. Ser. A 10 (1989) 94\u201399 (in Chinese)."},{"key":"10.1016\/S0166-218X(00)00260-2_BIB14","series-title":"Free Monoids and Languages","author":"Shyr","year":"1991"},{"issue":"3","key":"10.1016\/S0166-218X(00)00260-2_BIB15","first-page":"441","article-title":"Relations and Codes","volume":"12","author":"Thierrin","year":"1991","journal-title":"J. Inform. Optim. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002602?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002602?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,15]],"date-time":"2020-01-15T11:52:13Z","timestamp":1579089133000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0166218X00002602"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00260-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}