{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T04:09:36Z","timestamp":1745554176500},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422877"},{"type":"electronic","value":"9783540482246"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-48224-5_85","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T06:29:04Z","timestamp":1193552944000},"page":"1052-1064","source":"Crossref","is-referenced-by-count":3,"title":["Communication Gap for Finite Memory Devices"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Jurdzi\u0144ski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miros\u0142aw","family":"Kuty\u0142owski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,4]]},"reference":[{"key":"85_CR1","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1137\/S0097539791196883","volume":"23","author":"P. Beame","year":"1994","unstructured":"P. Beame, M. Tompa, P. Yan, Communication-Space Tradeoffs for Unrestricted Protocols, SICOMP 23 (1994), 652\u2013661.","journal-title":"SICOMP"},{"key":"85_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1002\/cpa.3160220202","volume":"22","author":"P. J. Cohen","year":"1969","unstructured":"P. J. Cohen, Decision procedures for real and p-adic fields, Comm. on Pure and Applied Math. 22 (1969), 131\u2013151.","journal-title":"Comm. on Pure and Applied Math."},{"key":"85_CR3","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/inco.1994.1067","volume":"113","author":"E. Contejean","year":"1994","unstructured":"E. Contejean, H. Devie, An efficient algorithm for solving systems of diophantine equations, Information and Computation 113 (1994), 143\u2013172.","journal-title":"Information and Computation"},{"issue":"1","key":"85_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2307\/2042554","volume":"72","author":"J. z. Gathen von","year":"1978","unstructured":"J. von zur Gathen, M. Sieveking, A bound on solutions of linear integer equalities and inequalities, Proc. of the AMS 72(1) (1978), 155\u2013158.","journal-title":"Proc. of the AMS"},{"key":"85_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/BFb0029973","volume-title":"Proc. MFCS\u201997","author":"M. Holzer","year":"1997","unstructured":"M. Holzer, Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations, Proc. MFCS\u201997, LNCS 1295, Springer Verlag, Berlin, 1997, 299\u2013309."},{"key":"85_CR6","unstructured":"J. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979."},{"key":"85_CR7","unstructured":"T. Jurdzi\u0144ski, Communication Aspects of Computation of Systems of Finite Automata, Wroc\u0142aw University, 2000. (\n                    http:\/\/www.ii.uni.wroc.pl\/~acm\/doktoraty.html\n                    \n                  )"},{"key":"85_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/3-540-48686-0_32","volume-title":"Computing and Combinatorics, Proc. COCOON\u201999","author":"T. Jurdzi\u0144ski","year":"1999","unstructured":"T. Jurdzi\u0144ski, M. Kuty\u0142owski, K. Lory\u015b, Multiparty finite computations, in Computing and Combinatorics, Proc. COCOON\u201999, LNCS 1627, Springer Verlag, Berlin, 1999, 318\u2013329."},{"key":"85_CR9","doi-asserted-by":"publisher","first-page":"271","DOI":"10.2307\/1998219","volume":"235","author":"L. Lipshitz","year":"1978","unstructured":"L. Lipshitz, The diophantine problem for addition and divisibility, J. AMS 235 (1978), 271\u2013283.","journal-title":"J. AMS"},{"key":"85_CR10","first-page":"41","volume":"33","author":"L. Lipshitz","year":"1981","unstructured":"L. Lipshitz, Some remarks on the diophantine problem for addition and divisibility, Bull. Soc. Math Belg. 33 (1981), 41\u201352.","journal-title":"Bull. Soc. Math Belg."},{"key":"85_CR11","volume-title":"Foundations in Computing Series","author":"Ju. Matijasevi\u010d","year":"1993","unstructured":"Ju. Matijasevi\u010d, Hilbert\u2019s tenth problem, Foundations in Computing Series, MIT Press, Cambridge, 1993."},{"issue":"3","key":"85_CR12","first-page":"301","volume":"5","author":"V. Mitrana","year":"2000","unstructured":"V. Mitrana, On the degree of communication in parallel communicating finite automata systems, Journal of Automata, Languages and Computation Vol. 5, 3(2000), 301\u2013314.","journal-title":"Journal of Automata, Languages and Computation"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48224-5_85","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T19:29:09Z","timestamp":1551036549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48224-5_85"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422877","9783540482246"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-48224-5_85","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}