{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:35:19Z","timestamp":1775014519858,"version":"3.50.1"},"reference-count":14,"publisher":"Pleiades Publishing Ltd","issue":"6","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"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":["Program Comput Soft"],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1134\/s0361768813060054","type":"journal-article","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T17:08:37Z","timestamp":1397236117000},"page":"301-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Bounded monotone recursion and multihead automata"],"prefix":"10.1134","volume":"39","author":[{"given":"S. S.","family":"Marchenkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2013,11,19]]},"reference":[{"key":"6193_CR1","first-page":"46","volume-title":"Problemy kibernetiki","author":"AA Lyapunov","year":"1958","unstructured":"Lyapunov, A.A., On logical schemes of programs, in Problemy kibernetiki (Problems of Cybernetics), Moscow: Fizmatgiz, 1958, vol. 1, pp. 46\u201374."},{"key":"6193_CR2","first-page":"75","volume-title":"Problemy kibernetiki","author":"Yu I Yanov","year":"1958","unstructured":"Yanov, Yu. I., On logical schemes of algorithms, in Problemy kibernetiki (Problems of Cybernetics), Moscow: Fizmatgiz, 1958, vol. 1, pp. 75\u2013127."},{"key":"6193_CR3","first-page":"3","volume-title":"Programmirovanie","author":"RI Podlovchenko","year":"1981","unstructured":"Podlovchenko, R.I., Hierarchy of program models, Programmirovanie, 1981, no. 2, pp. 3\u201314."},{"key":"6193_CR4","first-page":"44","volume-title":"Programmirovanie","author":"RI Podlovchenko","year":"1991","unstructured":"Podlovchenko, R.I., Recursive programs and hierarchies of their models, Programmirovanie, 1991, no. 6, pp. 44\u201351."},{"key":"6193_CR5","volume-title":"Rozprawy Matematyczne, vol. 4: Some Classes of Recursive Functions","author":"A Grzegorczyk","year":"1953","unstructured":"Grzegorczyk, A., Rozprawy Matematyczne, vol. 4: Some Classes of Recursive Functions, Warsaw: Math. Inst., Polish Acad. Sci., 1953."},{"key":"6193_CR6","volume-title":"Elementarnye rekursivnye funktsii","author":"SS Marchenkov","year":"2003","unstructured":"Marchenkov, S.S., Elementarnye rekursivnye funktsii (Elementary Recursive Functions), Moscow: MTsNMO, 2003."},{"issue":"4","key":"6193_CR7","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1134\/S1990478910040149","volume":"4","author":"SA Volkov","year":"2010","unstructured":"Volkov, S.A., On the class of Skolem elementary functions, J. Appl. Industrial Math., 2010, vol. 4, no. 4, pp. 588\u2013599.","journal-title":"J. Appl. Industrial Math."},{"key":"6193_CR8","first-page":"163","volume":"16","author":"SA Volkov","year":"2007","unstructured":"Volkov, S.A., An exponential extension of the class of Skolem elementary functions and bounded superpositions of simple arithmetic functions, in Matematicheskie voprosy kibernetiki (Mathematical Questions of Cybernetics), Moscow: Fizmatlit, 2007, vol. 16, pp. 163\u2013190.","journal-title":"Matematicheskie voprosy kibernetiki"},{"key":"6193_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-1-4612-3466-1_4","volume-title":"Feasible Mathematics","author":"P Clote","year":"1990","unstructured":"Clote, P., Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, ACk, NCk and NC, in Feasible Mathematics Boston: Birkh\u00e4user, 1990, pp. 49\u201369."},{"key":"6193_CR10","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0049-237X(99)80033-0","volume-title":"Handbook of Computability Theory","author":"P Clote","year":"1999","unstructured":"Clote, P., Computation models and functional algebras, in Handbook of Computability Theory, Amsterdam: Elsevier, 1999, pp. 589\u2013681."},{"key":"6193_CR11","unstructured":"Mazzanti, S., CRN elimination and substitution bases for complexity classes. http:\/\/rice.iuav.it\/311\/1\/bases18rice.pdf"},{"key":"6193_CR12","first-page":"127","volume-title":"Problemy kibernetiti","author":"VA Kozmidiadi","year":"1969","unstructured":"Kozmidiadi, V.A. and Marchenkov, S.S., On multihead automata, in Problemy kibernetiti (Problems of Cybernetics), Moscow: Nauka, 1969, vol. 21, pp. 127\u2013158."},{"issue":"5","key":"6193_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/BF01112182","volume":"5","author":"SS Marchenkov","year":"1969","unstructured":"Marchenkov, S.S., Elimination of recursion schemas in the Grzegorczyk \n                    \n                   class, Math. Notes, 1969, vol. 5, no. 5, pp. 561\u2013568.","journal-title":"Math. Notes"},{"key":"6193_CR14","volume-title":"Theory of Formal Systems","author":"R Smullyan","year":"1959","unstructured":"Smullyan, R., Theory of Formal Systems, Princeton: Princeton Univ., 1959."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768813060054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768813060054","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768813060054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768813060054.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:19:22Z","timestamp":1775009962000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768813060054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["6193"],"URL":"https:\/\/doi.org\/10.1134\/s0361768813060054","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"3 September 2012","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2013","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}