{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T05:59:59Z","timestamp":1698731999871},"reference-count":0,"publisher":"World Scientific Pub Co Pte Lt","issue":"03n04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[1994,12]]},"abstract":"<jats:p> Cai and Furst introduced the notion of bottleneck Turing machines. Based on Barrington\u2019s innovating technique, which is used to showed that polynomial-size branching programs have exactly the same power as NC<jats:sup>1<\/jats:sup>, Cai and Furst showed that the languages recognized by width-5 bottleneck Turing machines are exactly the same as those in PSPACE. In this paper, computational power of bottleneck Turing machines with widths fewer than 5 is investigated. It is shown that width-2 bottleneck Turing machines capture \u2295P\/\/ OptP , the class of sets recognized by \u2295P-machines with pre-computation in OptP. For languages recognized by bottleneck Turing machines with width-3 and width-4, some lower-bounds and upper-bounds are shown. <\/jats:p>","DOI":"10.1142\/s0129054194000177","type":"journal-article","created":{"date-parts":[[2004,11,19]],"date-time":"2004-11-19T02:21:13Z","timestamp":1100830873000},"page":"303-318","source":"Crossref","is-referenced-by-count":4,"title":["ON SERIALIZABLE LANGUAGES"],"prefix":"10.1142","volume":"05","author":[{"given":"MITSUNORI","family":"OGIHARA","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Rochester Rochester, New York 14627, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054194000177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:44:10Z","timestamp":1565138650000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054194000177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":0,"journal-issue":{"issue":"03n04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[1994,12]]}},"alternative-id":["10.1142\/S0129054194000177"],"URL":"https:\/\/doi.org\/10.1142\/s0129054194000177","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}