{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:06:36Z","timestamp":1775016396654,"version":"3.50.1"},"reference-count":7,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1134\/s0032946019030062","type":"journal-article","created":{"date-parts":[[2019,10,16]],"date-time":"2019-10-16T06:04:33Z","timestamp":1571205873000},"page":"275-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Alphabetic Coding for Superwords"],"prefix":"10.1134","volume":"55","author":[{"given":"S. S.","family":"Marchenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2019,10,16]]},"reference":[{"key":"4357_CR1","first-page":"521","volume":"132","author":"AlA Markov","year":"1960","unstructured":"Markov, Al.A., On Alphabet Coding, Dokl. Akad. Nauk SSSR, 1960, vol. 132, no. 3, pp. 521\u2013523 [Soviet Math. Dokl. (Engl. Transl.), 1960, vol. 1, pp. 596-598].","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"4357_CR2","first-page":"169","volume":"8","author":"AlA Markov","year":"1962","unstructured":"Markov, Al.A., Non-recurrent Coding, Probl. Kibern., 1962, vol. 8, pp. 169\u2013186.","journal-title":"Probl. Kibern."},{"key":"4357_CR3","volume-title":"Vvedenie v teoriyu kodirovaniya (Introduction to Coding Theory), Moscow: Nauka","author":"AA Markov","year":"1982","unstructured":"Markov, A.A., Vvedenie v teoriyu kodirovaniya (Introduction to Coding Theory), Moscow: Nauka, 1982."},{"key":"4357_CR4","volume-title":"Theory of Recursive Functions and Effective Computability, New York: McGraw-Hill, 1967. Translated under the title Teoriya rekursivnykh funktsii i effektivnaya vychislimost'","author":"H Rogers","year":"1972","unstructured":"Rogers, H., Theory of Recursive Functions and Effective Computability, New York: McGraw-Hill, 1967. Translated under the title Teoriya rekursivnykh funktsii i effektivnaya vychislimost', Moscow: Mir, 1972."},{"key":"4357_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.4213\/dm1253","volume":"25","author":"SS Marchenkov","year":"2013","unstructured":"Marchenkov, S.S., Definability in the Language of Functional Equations of a Countable-Valued Logic, Diskret. Mat., 2013, vol. 25, no. 4, pp. 13\u201323 [Discrete Math. Appl. (Engl. Transl.), 2013, vol. 23, no. 5\u20136, pp. 451\u2013462].","journal-title":"Diskret. Mat."},{"key":"4357_CR6","first-page":"49","volume":"22","author":"SS Marchenkov","year":"2015","unstructured":"Marchenkov, S.S., On Complexity of Solving Systems of Functional Equations in Countable-Valued Logic, Diskretn. Anal. Issled. Oper., 2015, vol. 22, no. 2, pp. 49\u201362.","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"4357_CR7","first-page":"42","volume-title":"Vestn ik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet.","author":"SS Marchenkov","year":"2013","unstructured":"Marchenkov, S.S. and Kalinina, I.S., The FE-Closure Operator in Countable-Valued Logic, Vestn ik Moskov. Univ. Ser. XV Vychisl. Mat. Kibernet., 2013, no. 3, pp. 42\u201347 [Moscow Univ. Comput. Math. Cybernet. (Engl. Transl.), 2013, vol. 37, no. 3, pp. 131-136]."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946019030062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946019030062","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946019030062.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:36:43Z","timestamp":1775011003000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946019030062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["4357"],"URL":"https:\/\/doi.org\/10.1134\/s0032946019030062","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"9 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}