{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:06:05Z","timestamp":1725505565470},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540784975"},{"type":"electronic","value":"9783540784999"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78499-9_19","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T19:02:25Z","timestamp":1207076545000},"page":"261-272","source":"Crossref","is-referenced-by-count":0,"title":["Systems of Equations Satisfied in All Commutative Finite Semigroups"],"prefix":"10.1007","author":[{"given":"Pawe\u0142","family":"Parys","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-27836-8_23","volume-title":"Automata, Languages and Programming","author":"M. Boja\u0144czyk","year":"2004","unstructured":"Boja\u0144czyk, M., Colcombet, T.: Tree-walking automata cannot be determinized. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, p. 246\u2013256. Springer, Heidelberg (2004)"},{"issue":"2","key":"19_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2041711","volume":"55","author":"I. Borosh","year":"1976","unstructured":"Borosh, I., Treybig, L.B.: Bounds on positive integral solutions of linear diophantine equations. Proc. Amer. Math. Soc.\u00a055(2), 299\u2013304 (1976)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1090\/S0002-9939-99-04747-4","volume":"127","author":"T. Coulbois","year":"1999","unstructured":"Coulbois, T., Khelif, A.: Equations in free groups are not finitely approximable. Proc. Amer. Math. Soc.\u00a0127(4), 963\u2013965 (1999)","journal-title":"Proc. Amer. Math. Soc."},{"issue":"5","key":"19_CR4","first-page":"25","volume":"5","author":"Y. Gurevich","year":"1966","unstructured":"Gurevich, Y.: The word problem for certain classes of semigroups. Algebra and Logic\u00a05(5), 25\u201335 (1966) (in Russian)","journal-title":"Algebra and Logic"},{"key":"19_CR5","unstructured":"Guti\u00e9rrez, C.: Satisfiability of word equations with constants is in exponential space. In: Foundations of Computer Science, pp. 112\u2013120 (1998)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00224-005-1279-2","volume":"40","author":"O. Klima","year":"2007","unstructured":"Klima, O., Tesson, P., Therien, D.: Dichotomies in the complexity of solving systems of equations over finite semigroups. Theor. Comp. Sys.\u00a040(3), 263\u2013297 (2007)","journal-title":"Theor. Comp. Sys."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S.: The problem of solvability of equations in a free semigroup. USSR Sbornik\u00a032, 129\u2013198 (1977)","journal-title":"USSR Sbornik"},{"issue":"2","key":"19_CR9","doi-asserted-by":"publisher","first-page":"110","DOI":"10.2307\/2307797","volume":"61","author":"D. McLean","year":"1954","unstructured":"McLean, D.: Idempotent semigroups. The American Mathematical Monthly\u00a061(2), 110\u2013113 (1954)","journal-title":"The American Mathematical Monthly"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in pspace. In: Foundations of Computer Science, pp. 731\u2013742 (1999)","DOI":"10.1109\/SFFCS.1999.814622"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Plandowski, W., Rytter, W.: Application of lempel-ziv encodings to the solution of word equations. In: International Colloquium on Automata, Languages and Programming, pp. 731\u2013742 (1998)","DOI":"10.1007\/BFb0055097"},{"key":"19_CR12","volume-title":"Undecidable theories","author":"A. Tarski","year":"1953","unstructured":"Tarski, A., Mostowski, A., Robinson, M.R.: Undecidable theories. North-Holland, Amsterdam (1953)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78499-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:30Z","timestamp":1619507490000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78499-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540784975","9783540784999"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78499-9_19","relation":{},"subject":[]}}