{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T07:48:23Z","timestamp":1773820103586,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T00:00:00Z","timestamp":1597276800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002261","name":"\u0420\u043e\u0441\u0441\u0438\u0439\u0441\u043a\u0438\u0439 \u0424\u043e\u043d\u0434 \u0424\u0443\u043d\u0434\u0430\u043c\u0435\u043d\u0442\u0430\u043b\u044c\u043d\u044b\u0445 \u0418\u0441\u0441\u043b\u0435\u0434\u043e\u0432\u0430\u043d\u0438\u0439","doi-asserted-by":"publisher","award":["20-01-00435"],"award-info":[{"award-number":["20-01-00435"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00224-020-09995-4","type":"journal-article","created":{"date-parts":[[2020,8,13]],"date-time":"2020-08-13T08:03:46Z","timestamp":1597305826000},"page":"462-478","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Decidability of Theories of Regular Languages"],"prefix":"10.1007","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2659-265X","authenticated-orcid":false,"given":"Sergey","family":"Dudakov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4340-2435","authenticated-orcid":false,"given":"Boris","family":"Karlov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,13]]},"reference":[{"key":"9995_CR1","unstructured":"Aho, A.V., Ullman, J.D.: The theory of parsing, translation and compiling. Volume 1: parsing. Englewood cliffs, NJ: Prentice-Hall inc (1972)"},{"key":"9995_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic sequences: theory, applications, generalizations","author":"J Allouche","year":"2003","unstructured":"Allouche, J., Shallit, J.: Automatic sequences: theory, applications, generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"9995_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804076","volume-title":"Computability and Logic","author":"GS Boolos","year":"2007","unstructured":"Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic, 5th edn. Cambridge University Press, New York (2007)","edition":"5th edn."},{"issue":"2","key":"9995_CR4","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1134\/S1995080220020055","volume":"41","author":"SM Dudakov","year":"2020","unstructured":"Dudakov, S.M.: On undecidability of concatenation theory for one-symbol languages. Lobachevskii J. Math. 41(2), 168\u2013175 (2020)","journal-title":"Lobachevskii J. Math."},{"key":"9995_CR5","doi-asserted-by":"crossref","unstructured":"Dudakov, S., Karlov, B.: On decidability of regular languages theories. In: Van Bevern, R., Kucherov, G (eds.) Computer Science \u2014 Theory and Applications. CSR 2019. Lecture notes in computer science, vol. 11532, pp 119\u2013130 (2019)","DOI":"10.1007\/978-3-030-19955-5_11"},{"issue":"2","key":"9995_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s11225-005-2976-1","volume":"79","author":"A Grzegorczyk","year":"2005","unstructured":"Grzegorczyk, A.: Undecidability without arithmetization. Stud. Logica. 79(2), 163\u2013230 (2005)","journal-title":"Stud. Logica."},{"key":"9995_CR7","unstructured":"Grzegorczyk, A., Zdanowski, K.: Undecidability and Concatenation. In: Ehrenfeucht, A., Marek, V. W., Srebrny, M (eds.) Andrzej Mostowski and Foundational Studies, pp 72\u201391. IOS Press, Amsterdam (2008)"},{"key":"9995_CR8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2013","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Pearson, Harlow, Essex (2013)","edition":"3rd edn."},{"key":"9995_CR9","unstructured":"Karlov, B.N.: On regular languages theory with Kleene star operation (in Russian). In: Proceedings of International Conference Algebra and Mathematical Logic: Theory and Applications, pp 117\u2013119 (2019)"},{"key":"9995_CR10","doi-asserted-by":"crossref","unstructured":"Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C., McCarthy, J. (eds.) Automata Studies, pp 3\u201342. Princeton University Press, Princeton (1951)","DOI":"10.1515\/9781400882618-002"},{"key":"9995_CR11","unstructured":"Koppelberg, S.: HandBook of Boolean Algebras, Volume I. North Holland P.C (1989)"},{"issue":"4","key":"9995_CR12","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"RC Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation aM = bNcP in a free group. Michigan Math. J. 9(4), 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"9995_CR13","unstructured":"Minsky, M.L.: Computation: finite and infinite machines. Englewood cliffs, NJ: Prentice-Hall inc. (1967)"},{"key":"9995_CR14","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers","year":"1967","unstructured":"Rogers, H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill Education, New York (1967)"},{"key":"9995_CR15","volume-title":"A Two-Counter Machine Cannot Calculate 2N. Technical Report, vol. 257","author":"R Schroeppel","year":"1973","unstructured":"Schroeppel, R.: A Two-Counter Machine Cannot Calculate 2N. Technical Report, vol. 257. Massachusetts Institute of Technology, A. I. Laboratory (1973)"},{"issue":"1","key":"9995_CR16","first-page":"87","volume":"50","author":"V S\u0306vejdar","year":"2009","unstructured":"S\u0306vejdar, V.: On interpretability in the theory of concatenation. Notre dame J. Formal Logic 50(1), 87\u201395 (2009)","journal-title":"J. Formal Logic"},{"issue":"1","key":"9995_CR17","first-page":"61","volume":"50","author":"A Visser","year":"2009","unstructured":"Visser, A.: Growing commas. A study of sequentiality and concatenation. Notre dame J. Formal Logic 50(1), 61\u201385 (2009)","journal-title":"J. Formal Logic"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09995-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-09995-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-09995-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,6]],"date-time":"2022-11-06T20:20:34Z","timestamp":1667766034000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-09995-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,13]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9995"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-09995-4","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,13]]},"assertion":[{"value":"13 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}