{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:50Z","timestamp":1725456770131},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029608","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:33:46Z","timestamp":1133397226000},"page":"195-201","source":"Crossref","is-referenced-by-count":0,"title":["Some properties of zerotesting bounded one-way multicounter machines"],"prefix":"10.1007","author":[{"given":"Ivana","family":"\u010cern\u0100","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"T. Chan, Reversal complexity of counter machines, Proc. 13th ACM STOC (1981) 146\u2013157.","DOI":"10.1145\/800076.802468"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0022-0000(88)90008-6","volume":"37","author":"T. Chan","year":"1988","unstructured":"T. Chan, Pushdown automata with reversal-bounded counters, Journal of Computers and Systems Sciences 37 (1988) 269\u2013291.","journal-title":"Journal of Computers and Systems Sciences"},{"key":"17_CR3","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/S0019-9958(82)80023-5","volume":"54","author":"P. \u010euri\u0161","year":"1982","unstructured":"P. \u010euri\u0161 and Z. Galil, On reversal-bounded counter machines and on pushdown automata with a bound on the size of the pushdown store, Inform. and Control 54 (1982) 217\u2013227.","journal-title":"Inform. and Control"},{"key":"17_CR4","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(82)90087-1","volume":"21","author":"P. \u010euri\u0161","year":"1982","unstructured":"P. \u010euri\u0161 and Z. Galil, Folling a two-way automata or one pushdown store is better than one counter for two-way machines, Theoret. Comput. Sci. 21 (1982) 39\u201353.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR5","first-page":"13","volume":"23","author":"P. \u010euri\u0161","year":"1978","unstructured":"P. \u010euri\u0161 and J. Hromkovi\u010d, Zerotesting bounded one way multicounter machines, Kybernetika 23 (1978) 13\u201318.","journal-title":"Kybernetika"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"S.A. Greibach, Remarks on blind and partially blind one-way multicounter machines Theoret. Comput. Sci. 7 (1978) 311\u2013324.","journal-title":"Theoret. Comput. Sci."},{"key":"17_CR7","first-page":"312","volume":"176","author":"J. Hromkovi\u010d","year":"1984","unstructured":"J. Hromkovi\u010d, Hierachy of reversal and zerotesting bounded multicounter machines, Proc. 11th MFCS 84 LNCS 176 (1984) 312\u2013321.","journal-title":"LNCS"},{"key":"17_CR8","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/0304-3975(87)90040-5","volume":"51","author":"J. Hromkovi\u010d","year":"1987","unstructured":"J. Hromkovi\u010d, Reversal-bounded nondeterministic multi-counter machines and complmentation, Theor. Comput. Sci.51 (1987) 325\u2013330.","journal-title":"Theor. Comput. Sci."},{"key":"17_CR9","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"O.H. Ibarra","year":"1978","unstructured":"O.H. Ibarra, Reversal-bounded multicounter machines and their decision problems, J.ACM 25 (1978) 116\u2013133.","journal-title":"J.ACM"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"M. Jantzen, On zero-testing bounded multicounter machines Proc. 4th GI Conference 158\u2013169.","DOI":"10.1007\/3-540-09118-1_18"},{"key":"17_CR11","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","volume":"13","author":"M. Jantzen","year":"1979","unstructured":"M. Jantzen, On the hierarchy of Petri Net Languages, RAIRO Informatique Theoretique 13 (1979) 19\u201330.","journal-title":"RAIRO Informatique Theoretique"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0029608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:15:40Z","timestamp":1586578540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0029608","relation":{},"subject":[]}}