{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:05Z","timestamp":1725663425826},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540160663"},{"type":"electronic","value":"9783540397489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1985]]},"DOI":"10.1007\/3-540-16066-3_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:36:50Z","timestamp":1330195010000},"page":"80-90","source":"Crossref","is-referenced-by-count":0,"title":["On the log-space reducibility among array languages \/preliminary version\/"],"prefix":"10.1007","author":[{"given":"Marek","family":"Ejsmont","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Blum,M.,Hewitt,C., Automata on 2-dimensional tape, Proc. 8th IEEE Symp. on Switching Theory,1967,pp. 155\u2013160","DOI":"10.1109\/FOCS.1967.6"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/S0146-664X(78)80022-7","volume":"8","author":"C.,R. Cook","year":"1978","unstructured":"Cook, C.,R.,Wang, P.,S.,P., A Chomsky hierarchy of isotonic array grammars and languages, Comput. Graphics and Image Processing 8, 1978, 144\u2013152","journal-title":"Comput. Graphics and Image Processing"},{"key":"8_CR3","first-page":"623","volume":"20","author":"M. Ejsmont","year":"1984","unstructured":"Ejsmont, M., Problems in labyrinths decidable by pebble automata, Elektron. Informationsverarb. u. Kybernet. 20,1984,623\u2013632","journal-title":"Elektron. Informationsverarb. u. Kybernet."},{"key":"8_CR4","unstructured":"Ejsmont,M., Array languages acceptable in logarithmic space, in polish, Ph.D. dissertation, University of Gda\u0144sk, Institute of Mathematics,1985"},{"key":"8_CR5","unstructured":"Hartmanis,J., Feasible Computations and Provable Complexity Properties, CBMS-NSF Regional Conference Series in Applied Mathematics 30,1978, SIAM Monograph"},{"key":"8_CR6","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80050-X","volume":"11","author":"N.,D. Jones","year":"1975","unstructured":"Jones, N.,D., Space bounded reducibility among combinatorial problems, J. Comput. System Sci. 11, 1975,62\u201385","journal-title":"J. Comput. System Sci."},{"key":"8_CR7","first-page":"363","volume":"-14","author":"Computer interpretation of english text and picture patterns","year":"1964","unstructured":"Computer interpretation of english text and picture patterns, IEEE Trans. Comput. EC-14, 1964,363\u2013376","journal-title":"IEEE Trans. Comput. EC"},{"key":"8_CR8","first-page":"69","volume-title":"Array automata and array grammars, Information Processing 71","author":"D.,L. Miligram","year":"1972","unstructured":"Miligram, D.,L.,Rosenfeld, A., Array automata and array grammars, Information Processing 71, pp.69\u201374, North-Holland, Amsterdam, 1972"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0146-664X(72)80020-0","volume":"1","author":"J. Mylopoulos","year":"1972","unstructured":"Mylopoulos, J., On the recognition of topological invariants by 4-way finite automata, Comput. Graphics and Image Processing 1, 1972,308\u2013316","journal-title":"Comput. Graphics and Image Processing"},{"key":"8_CR10","first-page":"281","volume-title":"Isotonic grammars, parallel grammars and picture grammars, Machine Intelligence 6","author":"A. Rosenfeld","year":"1971","unstructured":"Rosenfeld, A., Isotonic grammars, parallel grammars and picture grammars, Machine Intelligence 6, pp.281\u2013294, American Elsevier, New York, 1971"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0019-9958(76)80006-X","volume":"31","author":"A. Rosenfeld","year":"1976","unstructured":"Rosenfeld, A., Some notes on finite-state picture languages, Inform. Control 31,1976,177\u2013184","journal-title":"Inform. Control"}],"container-title":["Lecture Notes in Computer Science","Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16066-3_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:02:57Z","timestamp":1619557377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16066-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"ISBN":["9783540160663","9783540397489"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-16066-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1985]]}}}