{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:55:55Z","timestamp":1773615355453,"version":"3.50.1"},"reference-count":21,"publisher":"Allerton Press","issue":"7","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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":["Aut. Conrol Comp. Sci."],"published-print":{"date-parts":[[2011,12]]},"DOI":"10.3103\/s0146411611070108","type":"journal-article","created":{"date-parts":[[2012,1,5]],"date-time":"2012-01-05T17:57:59Z","timestamp":1325786279000},"page":"469-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On languages of automaton counter machines"],"prefix":"10.3103","volume":"45","author":[{"given":"E. V.","family":"Kuzmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. J.","family":"Chalyy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1627","published-online":{"date-parts":[[2012,1,6]]},"reference":[{"key":"6175_CR1","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., \u010cer\u0101ns, K., Jonsson, R., and Yih-Kuen, T., General Decidability Theorems for Infinite-State Systems, Proc. 11th IEEE Symp. Logic in Computer Science (LICS\u201996), 1996, pp. 313\u2013321.","DOI":"10.1109\/LICS.1996.561359"},{"issue":"4","key":"6175_CR2","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1145\/321479.321488","volume":"15","author":"A.V. Aho","year":"1968","unstructured":"Aho, A.V., Indexed Grammars\u2014An Extension of Context-Free Grammars, J. ACM, 1968, vol. 15, no. 4, pp. 647\u2013671.","journal-title":"J. ACM"},{"key":"6175_CR3","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E., Finiteness of the Odd Perfect and Primitive Abundant Numbers with R Distinct Prime Factors, Am. J. Math., 1913, vol. 35, pp. 413\u2013422.","journal-title":"Am. J. Math."},{"issue":"2","key":"6175_CR4","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/0890-5401(90)90009-7","volume":"89","author":"A. Finkel","year":"1990","unstructured":"Finkel, A., Reduction and Covering of Infinite Reachability Trees, Inform. Comput., 1990, vol. 89, no. 2, pp. 144\u2013179.","journal-title":"Inform. Comput."},{"issue":"s.1\u20132","key":"6175_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A. Finkel","year":"2001","unstructured":"Finkel, A. and Schnoebelen, Ph., Well-Structured Transition Systems Everywhere!, Theor. Comp. Sci., 2001, vol. 256, nos. 1\u20132, pp. 63\u201392.","journal-title":"Theor. Comp. Sci."},{"key":"6175_CR6","unstructured":"Ginsburg, S., Algebraic and Automata-Theoretic Properties of Formal Languages, Elsevier, 1975."},{"key":"6175_CR7","first-page":"1","volume":"87","author":"S. Ginsburg","year":"1969","unstructured":"Ginsburg, S. and Greibash, S., Abstract Families of Languages, Memoirs Am. Math. Soc., 1969, vol. 87, pp. 1\u201332.","journal-title":"Memoirs Am. Math. Soc."},{"key":"6175_CR8","unstructured":"Hack, M., Decision Problems for Petri Nets and Vector Addition Systems, Project MAC Memo 59, Cambridge, 1975."},{"issue":"1","key":"6175_CR9","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","volume":"2","author":"M. Hack","year":"1976","unstructured":"Hack, M., The Equality Problem for Vector Addition Systems is Undecidable, Theor. Comp. Sci., 1976, vol. 2, no. 1, pp. 77\u201396.","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"6175_CR10","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"3","author":"G. Higman","year":"1952","unstructured":"Higman, G., Ordering by Divisibility in Abstract Algebra, Proc. London Math. Soc., 1952, vol. 3, no. 2, pp. 326\u2013336.","journal-title":"Proc. London Math. Soc."},{"key":"6175_CR11","unstructured":"Kouzmin, E.V. and Sokolov, V.A., Communicating Coloring Automata, Proc. Int. Workshop on Program Understanding, 2003, pp. 40\u201346."},{"key":"6175_CR12","unstructured":"Kuzmin, E.V., Sokolov, V.A., and Chalyy, D.Ju., Automaton Counter Machines, Proc. Int. Workshop on Program Understanding, 2009, pp. 1\u20134."},{"key":"6175_CR13","volume-title":"Lossy Counter Machines","author":"R. Mayr","year":"1998","unstructured":"Mayr, R., Lossy Counter Machines, Tech. Report TUM-I9827, Germany: Inst. f\u00fcr Informatik, 1998."},{"key":"6175_CR14","unstructured":"Peterson, J., Petri Net Theory and the Modeling of Systems, Prentice-Hall, 1981."},{"key":"6175_CR15","volume-title":"Seti Petri","author":"V.E. Kotov","year":"1984","unstructured":"Kotov, V.E., Seti Petri (Petri Nets), Moscow: Nauka, 1984."},{"issue":"2","key":"6175_CR16","first-page":"41","volume":"10","author":"E.V. Kuzmin","year":"2003","unstructured":"Kuzmin, E.V., Nondeterministic Counter Machines, Modelir. Analiz Inform. Sistem, 2003, vol. 10, no. 2, pp. 41\u201349.","journal-title":"Modelir. Analiz Inform. Sistem"},{"issue":"2","key":"6175_CR17","first-page":"8","volume":"11","author":"E.V. Kuzmin","year":"2004","unstructured":"Kuzmin, E.V. and Sokolov, V.A., Communicating Coloring Processes, Modelir. Analiz Inform. Sistem, 2004, vol. 11, no. 2, pp. 8\u201317.","journal-title":"Modelir. Analiz Inform. Sistem"},{"key":"6175_CR18","volume-title":"Strukturirovannye sistemy perekhodov","author":"E.V. Kuzmin","year":"2006","unstructured":"Kuzmin, E.V. and Sokolov, V.A., Strukturirovannye sistemy perekhodov (Structured Systems of Transitions), Moscow: Fizmatlit, 2006."},{"issue":"2","key":"6175_CR19","first-page":"75","volume":"16","author":"E.V. Kuzmin","year":"2009","unstructured":"Kuzmin, E.V. and Chalyy, D.Ju., On a Class of Counter Machines, Modelir. Analiz Inform. Sistem, 2009, vol. 16, no.2, pp. 75\u201382.","journal-title":"Modelir. Analiz Inform. Sistem"},{"issue":"2","key":"6175_CR20","first-page":"279","volume":"191","author":"Yu.V. Matiyasevich","year":"1970","unstructured":"Matiyasevich, Yu.V., Diofantity of Enumerable Sets, Dokl. Akad. Nauk SSSR, 1970, vol. 191, no. 2, pp. 279\u2013282.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"6175_CR21","doi-asserted-by":"crossref","unstructured":"Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D., Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 2001.","DOI":"10.1145\/568438.568455"}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S0146411611070108","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S0146411611070108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T21:58:45Z","timestamp":1773611925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S0146411611070108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["6175"],"URL":"https:\/\/doi.org\/10.3103\/s0146411611070108","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2 March 2010","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2012","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}