{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:41:29Z","timestamp":1649108489522},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,10,1]],"date-time":"1982-10-01T00:00:00Z","timestamp":402278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":11247,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,10]]},"DOI":"10.1016\/0304-3975(82)90086-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:17:21Z","timestamp":1027642641000},"page":"27-37","source":"Crossref","is-referenced-by-count":5,"title":["Two-way deterministic multi-weak-counter machines"],"prefix":"10.1016","volume":"21","author":[{"given":"Satoru","family":"Miyano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90086-X_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/BF01706072","article-title":"Multi-stack-counter languages","volume":"6","author":"Book","year":"1972","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90086-X_BIB2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fischer","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90086-X_BIB3","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01683273","article-title":"Some open problems in the theory of computation as questions about two-way deterministic pushdown automation languages","volume":"10","author":"Galil","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90086-X_BIB4","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1016\/S0019-9958(67)90369-5","article-title":"Two-way pushdown automata","volume":"11","author":"Gray","year":"1967","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90086-X_BIB5","first-page":"5","article-title":"A note on the recognition of one counter languages","volume":"9","author":"Greibach","year":"1975","journal-title":"Rev. Fran\u00e7ase Informat. Recherche Op\u00e9rationelle"},{"key":"10.1016\/0304-3975(82)90086-X_BIB6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(76)90072-4","article-title":"Remarks on the complexity of nondeterministic counter languages","volume":"1","author":"Greibach","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90086-X_BIB7","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","article-title":"Remarks on blind and partially blind one-way multicounter machines","volume":"7","author":"Greibach","year":"1978","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90086-X_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0022-0000(79)90025-4","article-title":"Simple counter machines and number-theoretic problems","volume":"19","author":"Gurari","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90086-X_BIB9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/0020-0190(74)90043-X","article-title":"A note on semilinear sets and bounded-reversal multihead pushdown automata","volume":"3","author":"Ibarra","year":"1974","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(82)90086-X_BIB10","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-bounded multicounter machines and their decision problems","volume":"25","author":"Ibarra","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90086-X_BIB11","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01744294","article-title":"Restricted one-counter machines with undecidable universe problems","volume":"13","author":"Ibarra","year":"1979","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(82)90086-X_BIB12","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(76)90081-5","article-title":"Finite automata with multiplication","volume":"2","author":"Ibarra","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(82)90086-X_BIB13","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1051\/ita\/1979130100191","article-title":"On the hierarchy of Petri Net languages","volume":"13","author":"Jantzen","year":"1979","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"10.1016\/0304-3975(82)90086-X_BIB14","first-page":"334","article-title":"Finite reversal pushdown automata and semilinear sets","author":"Liu","year":"1968","journal-title":"Proc. 2nd Annual Princeton Conference on Information Science Systems"},{"key":"10.1016\/0304-3975(82)90086-X_BIB15","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of Post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. Math."},{"key":"10.1016\/0304-3975(82)90086-X_BIB16","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1145\/321356.321364","article-title":"On context-free languages","volume":"13","author":"Parikh","year":"1966","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90086-X_BIB17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0019-9958(74)90994-2","article-title":"Bounded-reversal multihead finite automata","volume":"25","author":"Sudborough","year":"1974","journal-title":"Information and Control"},{"key":"10.1016\/0304-3975(82)90086-X_BIB18","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/S0022-0000(75)80014-6","article-title":"On tape-bounded complexity classes and multihead finite automata","volume":"10","author":"Sudborough","year":"1975","journal-title":"J. Comput. System Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290086X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290086X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T09:55:10Z","timestamp":1555062910000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758290086X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,10]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,10]]}},"alternative-id":["030439758290086X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90086-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,10]]}}}