{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T02:55:22Z","timestamp":1771901722085,"version":"3.50.1"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"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 Processing Letters"],"published-print":{"date-parts":[[1983,4]]},"DOI":"10.1016\/0020-0190(83)90067-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:20:15Z","timestamp":1027657215000},"page":"147-151","source":"Crossref","is-referenced-by-count":26,"title":["Polynomial complete problems in automata theory"],"prefix":"10.1016","volume":"16","author":[{"given":"I.K.","family":"Rystsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90067-4_BIB1","first-page":"254","article-title":"Lower bounds for natural proof systems","author":"Kozen","year":"1977","journal-title":"Proc. 18th Ann. Symp. on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(83)90067-4_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0022-0000(74)80034-6","article-title":"Multiple-entry finite automata","volume":"9","author":"Gill","year":"1974","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"10.1016\/0020-0190(83)90067-4_BIB3","first-page":"1","article-title":"Abstractnaja teoria avtomatov","volume":"16","author":"Glushkov","year":"1961","journal-title":"Uspehi Mat. Nauk"},{"key":"10.1016\/0020-0190(83)90067-4_BIB4","series-title":"Finite-State Models for Logical Machines","author":"Hennie","year":"1968"},{"key":"10.1016\/0020-0190(83)90067-4_BIB5","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(83)90067-4_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","article-title":"Finite automata and their decision problems","volume":"3","author":"Rabin","year":"1959","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0020-0190(83)90067-4_BIB7","series-title":"Introduction to the Theory of Finite-State Machines","author":"Gill","year":"1962"},{"key":"10.1016\/0020-0190(83)90067-4_BIB8","series-title":"Automata Studies","article-title":"Gedanken experiments on sequential machines","author":"Moore","year":"1956"},{"key":"10.1016\/0020-0190(83)90067-4_BIB9","series-title":"Computers and Intractability","author":"Garey","year":"1979"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900674?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900674?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:52:43Z","timestamp":1555073563000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900674"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["0020019083900674"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90067-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}