{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:46:10Z","timestamp":1770993970838,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,10,1]],"date-time":"1980-10-01T00:00:00Z","timestamp":339206400000},"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":11977,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1980,10]]},"DOI":"10.1016\/0022-0000(80)90034-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"195-202","source":"Crossref","is-referenced-by-count":68,"title":["Lower bounds on the size of sweeping automata"],"prefix":"10.1016","volume":"21","author":[{"given":"Michael","family":"Sipser","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(80)90034-3_BIB1","series-title":"Proceedings, Twelfth Annual SWAT","first-page":"188","article-title":"Economy of description by automata, grammars, and formal systems","author":"Meyer","year":"1971"},{"key":"10.1016\/0022-0000(80)90034-3_BIB2","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v7i84.6500","article-title":"Succinctness of Description of Context Free, Regular and Finite Languages","author":"Schmidt","year":"1978"},{"key":"10.1016\/0022-0000(80)90034-3_BIB3","series-title":"Proceedings, Tenth Annual STOC","first-page":"275","article-title":"Nondeterminism and the size of two-way finite automata","author":"Sakoda","year":"1978"},{"key":"10.1016\/0022-0000(80)90034-3_BIB4","article-title":"On the Complexity of Regular Languages in Terms of Finite Automata","author":"Berman","year":"1977"},{"key":"10.1016\/0022-0000(80)90034-3_BIB5","series-title":"Proceedings, Third Annual STOC","first-page":"151","article-title":"The complexity of theorem proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0022-0000(80)90034-3_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0022-0000(80)90034-3_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationship between nondeterministic and deterministic tape complexities","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(80)90034-3_BIB8","unstructured":"J. Seiferas, personal communication."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900343?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900343?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:29:33Z","timestamp":1550305773000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000080900343"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,10]]}},"alternative-id":["0022000080900343"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(80)90034-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1980,10]]}}}