{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T23:04:17Z","timestamp":1762211057668},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf00267046","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:31:06Z","timestamp":1688488266000},"page":"589-594","source":"Crossref","is-referenced-by-count":4,"title":["Fooling a two-way nondeterministic multihead automaton with reversal number restriction"],"prefix":"10.1007","volume":"22","author":[{"given":"J.","family":"Hromkovi\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00267046_CR1","doi-asserted-by":"crossref","unstructured":"Chan, T.: Reversal Complexity of Counter Machines. Proc. 13th Ann. ACM Symp. on Theory of Computing, Milwaukee, 146\u2013157 (1981)","DOI":"10.1145\/800076.802468"},{"key":"BF00267046_CR2","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(82)90087-1","volume":"21","author":"P. \u010euris","year":"1982","unstructured":"\u010euris, P., Galil, Z.: Fooling a Two-Way Automaton or One Pushdown Store is better than One Counter for Two-Way machines. Theor. Comput. Sci. 21, 39\u201353 (1982)","journal-title":"Theor. Comput. Sci."},{"key":"BF00267046_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(82)80023-5","volume":"54","author":"P. \u010euris","year":"1982","unstructured":"\u010euris, P., Galil, Z.: On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store. Inf. Control 54, 217\u2013227 (1982)","journal-title":"Inf. Control"},{"key":"BF00267046_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01744430","volume":"17","author":"P. \u010euris","year":"1984","unstructured":"\u010euris, P., Galil, Z.: A time-space tradeoff for language recognition. Math. Syst. Theory 17, 3\u201312 (1984)","journal-title":"Math. Syst. Theory"},{"key":"BF00267046_CR5","series-title":"Lect. Notes Comput. Sci., vol. 140","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BFb0012767","volume-title":"Proc. 9th ICALP","author":"P. \u010euris","year":"1982","unstructured":"\u010euris, P., Hromkovi\u010d, J.: Multihead finite state automata and concatenation. Proc. 9th ICALP; Lect. Notes Comput. Sci., vol. 140, pp. 176\u2013186. Berlin-Heidelberg-New York: Springer 1982"},{"key":"BF00267046_CR6","series-title":"Lect. Notes Comput. Sci., vol. 176","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1007\/BFb0030312","volume-title":"Proc. 11th MFCS","author":"J. Hromkovi\u010d","year":"1984","unstructured":"Hromkovi\u010d, J.: On the power of alternation in finite automata. Proc. 11th MFCS; Lect. Notes Comput. Sci., vol. 176, pp. 312\u2013321. Berlin-Heidelberg-New York-Tokyo: Springer 1984"},{"key":"BF00267046_CR7","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/BF00290734","volume":"19","author":"J. Hromkovi\u010d","year":"1983","unstructured":"Hromkovi\u010d, J.: One-way multihead deterministic finite automata. Acta Inf. 19, 377\u2013384 (1983)","journal-title":"Acta Inf."},{"key":"BF00267046_CR8","unstructured":"Ibarra, O.H., Gurari, E.M.: Two-way counter machine and Diophantine equations. Techn. Rep. 80\u201317, University of Minnesota: Computer Science Department 1980"},{"key":"BF00267046_CR9","first-page":"214","volume-title":"Proc. FCT '79","author":"L. Janiga","year":"1979","unstructured":"Janiga, L.: Real time computations on two-way multihead finite automata. Proc. FCT '79, pp. 214\u2013218. Berlin: Akademie 1979"},{"issue":"2","key":"BF00267046_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/322063.322065","volume":"25","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Yao, A.C.: k+1 heads are better than k. J. ACM 25, (2) 337\u2013340 (1978)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00267046\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267046.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:31:22Z","timestamp":1688488282000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00267046"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":10,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF00267046"],"URL":"https:\/\/doi.org\/10.1007\/bf00267046","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}