{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:23:41Z","timestamp":1775013821345,"version":"3.50.1"},"reference-count":13,"publisher":"Pleiades Publishing Ltd","issue":"1","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010,1]]},"DOI":"10.1134\/s0361768810010020","type":"journal-article","created":{"date-parts":[[2010,2,8]],"date-time":"2010-02-08T05:00:06Z","timestamp":1265605206000},"page":"3-10","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Boundedness problems for Minsky counter machines"],"prefix":"10.1134","volume":"36","author":[{"given":"E. V.","family":"Kuzmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. A.","family":"Sokolov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Yu.","family":"Chalyy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2010,2,9]]},"reference":[{"key":"6049_CR1","volume-title":"Finite and Infinite Machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M., Finite and Infinite Machines, Englewood Cliffs, N.J.: Prentice Hall, 1967."},{"key":"6049_CR2","volume-title":"Seti Petri","author":"V.E. Kotov","year":"1984","unstructured":"Kotov, V.E., Seti Petri (Petri Nets), Moscow: Nauka, 1984 [in Russian]."},{"key":"6049_CR3","volume-title":"Tech. Report TUM-I9827","author":"R. Mayr","year":"1998","unstructured":"Mayr, R., Lossy Counter Machines, Tech. Report TUM-I9827, Institut f\u00fcr Informatik, TUM, M\u00fcnchen, Germany, October 1998."},{"key":"6049_CR4","unstructured":"Clarke, E. M., Grumberg, O., and Peled, D., Model Checking, MIT Press, 1999. Translated under the title Verifikatsiya modelei program: Model Checking, Moscow: MTsNMO, 2002."},{"key":"6049_CR5","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48523-6_27","volume":"1644","author":"C. Dufourd","year":"1999","unstructured":"Dufourd, C., Jancar, P., and Schnoebelen, Ph., Boundedness of Reset P\/T Nets, Lecture Notes in Computer Science (Proc. of ICALP\u201999), Springer, 1999, vol. 1644, pp. 301\u2013310.","journal-title":"Lecture Notes in Computer Science"},{"key":"6049_CR6","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/978-3-540-32033-3_23","volume":"3467","author":"P. Lafourcade","year":"2005","unstructured":"Lafourcade, P., Lugiez, D., and Treinen, R., Intruder Deduction for AC-like Equational Theories with Homomorphisms, Lecture Notes in Computer Science (RTA\u201905), Springer, 2005, vol. 3467, pp. 308\u2013322.","journal-title":"Lecture Notes in Computer Science (RTA\u201905)"},{"key":"6049_CR7","first-page":"85","volume-title":"On Validation of XML Streams Using Finite State Machines","author":"C. Chitic","year":"2004","unstructured":"Chitic, C. and Rosu, D., On Validation of XML Streams Using Finite State Machines, Paris: WebDB, 2004, pp. 85\u201390."},{"key":"6049_CR8","first-page":"260","volume":"3264","author":"M. Wakatsuki","year":"2004","unstructured":"Wakatsuki, M., Teraguchi, K., and Tomita, E., Polynomial Time Identification of Strict Deterministic Restricted One-Counter Automata in Some Class from Positive Data, Lecture Notes in Artificial Intelligence (ICGI 2004, Athens), Springer, 2004, vol. 3264, pp. 260\u2013272.","journal-title":"Lecture Notes in Artificial Intelligence (ICGI 2004, Athens)"},{"key":"6049_CR9","doi-asserted-by":"crossref","unstructured":"Hopcroft, J.E., Motwani, R., and Ullman, J.D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001.","DOI":"10.1145\/568438.568455"},{"key":"6049_CR10","first-page":"490","volume":"4962","author":"S. Demri","year":"2008","unstructured":"Demri, S., Lazic, R., and Sangnier, A., Model Checking Freeze LTL over One-Counter Automata, Lecture Notes in Computer Science (Proc. of the 11th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS\u201908)), Springer, 2008, vol. 4962, pp. 490\u2013504; http:\/\/www.lsv.ens-cachan.fr\/Publis\/ PAPERS\/PDF\/DLS-fossacs08.pdf.","journal-title":"Lecture Notes in Computer Science (Proc. of the 11th Int. Conf. on Foundations of Software Science and Computation Structures (FoSSaCS\u201908))"},{"key":"6049_CR11","volume-title":"Algoritmy i rekursivnye funktsii","author":"A.I. Mal\u2019tsev","year":"1986","unstructured":"Mal\u2019tsev, A.I., Algoritmy i rekursivnye funktsii (Algorithms and Recursive Functions), Moscow: Nauka, 1986, 2nd ed. [in Russian].","edition":"2nd ed."},{"issue":"4","key":"6049_CR12","first-page":"42","volume":"15","author":"E.V. Kuzmin","year":"2008","unstructured":"Kuzmin, E.V. and Chalyy, D.Yu., Algorithms for Solving Boundedness Problems for Counter Machines, in Modelirovanie i analiz informatsionnykh system (Simulation and Analysis of Information Systems), Yaroslavl, 2008, vol. 15,no. 4, pp. 42\u201355.","journal-title":"Modelirovanie i analiz informatsionnykh system"},{"key":"6049_CR13","volume-title":"Strukturirovannye sistemy perekhodov","author":"E.V. Kuzmin","year":"2006","unstructured":"Kuzmin, E.V. and Sokolov, V.A., Strukturirovannye sistemy perekhodov (Well-Structured Transition Systems), Moscow: Fizmatlit, 2006 [in Russian]."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810010020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768810010020","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810010020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768810010020.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:12:24Z","timestamp":1775009544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768810010020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["6049"],"URL":"https:\/\/doi.org\/10.1134\/s0361768810010020","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1]]},"assertion":[{"value":"15 August 2008","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2010","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}