{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:57:36Z","timestamp":1725663456012},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540563464"},{"type":"electronic","value":"9783540475385"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-56346-6_36","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:03:22Z","timestamp":1330236202000},"page":"144-158","source":"Crossref","is-referenced-by-count":0,"title":["Constant leaf-size hierarchy of two-dimensional alternating turing machines"],"prefix":"10.1007","author":[{"given":"Akira","family":"Ito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsushi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasuyoshi","family":"Inagaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0022-0000(80)90036-7","volume":"21","author":"W.L. Ruzzo","year":"1980","unstructured":"W.L.Ruzzo, Tree-size bounded alternation, J. Comp. Sys. Sci. 21, pp.218\u2013235 (1980).","journal-title":"J. Comp. Sys. Sci."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"K.N.King, Measures of parallelism in alternating computation trees, Proc. 13th ACM Symp. on Theory of Comp., pp.189\u2013201 (1981).","DOI":"10.1145\/800076.802472"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0304-3975(83)90093-2","volume":"27","author":"K. Inoue","year":"1983","unstructured":"K.Inoue, I.Takanami,and H.Taniguchi, Two-dimen-sional alternating Turing machines, Theoret. Comput. Sci. 27, pp.61\u201383 (1983).","journal-title":"Theoret. Comput. Sci."},{"issue":"No.1","key":"12_CR4","first-page":"133","volume":"E75-D","author":"H. Yamamoto","year":"1992","unstructured":"H.Yamamoto, Leaf reduction theorem on time-and leaf-bounded alternating Turing machines, IEICE Trans. Inf. & Syst. E75-D, No.1, pp.133\u2013140 (Jan. 1992).","journal-title":"IEICE Trans. Inf. & Syst."},{"issue":"No.2\u20133","key":"12_CR5","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/0304-3975(85)90048-9","volume":"36","author":"H. Matsuno","year":"1985","unstructured":"H.Matsuno, K.Inoue, I.Takanami, and H.Taniguchi, Alternating simple multi-head automata, Theoret. Comput. Sci. 36, No.2\u20133, pp.291\u2013308 (Mar.1985).","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR6","unstructured":"J.Hromkovic,K.Inoue,and I.Takanami, Lower bounds for language recognition on two-dimen-sional alternating multihead machines, to appear in J. Comp. Sys. Sci."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0019-9958(82)90572-1","volume":"55","author":"A. Ito","year":"1983","unstructured":"A.Ito, K.Inoue, I.Takanami, and H.Taniguchi, Two-dimensional alternating Turing machines with only universal states, Inform. and Control 55, pp.193\u2013221 (1983).","journal-title":"Inform. and Control"},{"issue":"No.19","key":"12_CR8","first-page":"1","volume":"AL79","author":"K. Morita","year":"1979","unstructured":"K.Morita, H.Umeo, and K.Sugata, Accepting Abilities of Offside-free Two-dimensional Marker Automata \u2014 The simulation of Four-way Automata by Three-way Tape-bounded Turing Machines, The Technical Reports of the Institute of Electronics and Communication Engineers of Japan Vol. AL79, No.19, pp.1\u201310(1979).","journal-title":"The Technical Reports of the Institute of Electronics and Communication Engineers of Japan"},{"key":"12_CR9","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0020-0255(80)90023-7","volume":"20","author":"K. Inoue","year":"1980","unstructured":"K.Inoue and I.Takanami, A Note on Deterministic Three-Way Tape-Bounded Two-Dimen-sional Turing Machines, Information Sciences 20, pp.41\u201355 (1980).","journal-title":"Information Sciences"},{"issue":"No.3","key":"12_CR10","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1142\/S0218001489000309","volume":"3","author":"A. Ito","year":"1989","unstructured":"A.Ito, K.Inoue,and I.Takanami, The simulation of two-dimensional one-marker automata by three-way Turing machines, Inter. J. of Patt. Recog. & Art. Intel. 3, No. 3&4, pp.393\u2013404 (1989).","journal-title":"Inter. J. of Patt. Recog. & Art. Intel."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"A.Rosenfeld, Picture Languages \u2014 Formal models for Picture Recognition, Academic Press (1979).","DOI":"10.1007\/978-3-642-67740-3_5"}],"container-title":["Lecture Notes in Computer Science","Parallel Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56346-6_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T14:22:17Z","timestamp":1687270937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56346-6_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540563464","9783540475385"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56346-6_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}