{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:13:19Z","timestamp":1648617199553},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1016\/0020-0255(79)90019-7","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"239-251","source":"Crossref","is-referenced-by-count":1,"title":["On-line n-bounded multicounter automata"],"prefix":"10.1016","volume":"17","author":[{"given":"Katsushi","family":"Inoue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Itsuo","family":"Takanami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(79)90019-7_BIB1","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01694011","article-title":"Counter machines and counter languages","volume":"2","author":"Fisher","year":"1968","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0020-0255(79)90019-7_BIB2","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. Computer Sci."},{"key":"10.1016\/0020-0255(79)90019-7_BIB3","first-page":"5","article-title":"A note of the recognition of one counter languages","volume":"R-2","author":"Greibach","year":"1975","journal-title":"R.A.I.R.O."},{"issue":"4","key":"10.1016\/0020-0255(79)90019-7_BIB4","first-page":"275","article-title":"The language accepted by n-bounded multicounter automaton and its computing ability","volume":"J60-D","author":"Sugata","year":"1977","journal-title":"IECE of Japan Trans. (D)"},{"key":"10.1016\/0020-0255(79)90019-7_BIB5","series-title":"Algebraic and Automata-Theoretic Properties of Formal Languages","author":"Ginsburg","year":"1975"},{"key":"10.1016\/0020-0255(79)90019-7_BIB6","series-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft","year":"1969"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025579900197?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025579900197?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:51:08Z","timestamp":1552913468000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025579900197"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["0020025579900197"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(79)90019-7","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}