{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:29:55Z","timestamp":1751293795253},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0890-5401(92)90002-w","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"1-22","source":"Crossref","is-referenced-by-count":25,"title":["The parallel complexity of finite-state automata problems"],"prefix":"10.1016","volume":"97","author":[{"given":"Sang","family":"Cho","sequence":"first","affiliation":[]},{"given":"Dung T.","family":"Huynh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90002-W_bib1","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","article-title":"A taxonomy of problems with fast parallel algorithms","volume":"64","author":"Cook","year":"1985","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(92)90002-W_bib2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(88)90012-6","article-title":"Note on the finite-valuedness problem for sequential machines","volume":"23","author":"Chan","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0890-5401(92)90002-W_bib3","author":"Garey","year":"1979"},{"key":"10.1016\/0890-5401(92)90002-W_bib4","series-title":"The Theory of Machines and Computations","first-page":"189","article-title":"An n log n algorithm for minimizing the states in a finite automaton","author":"Hopcroft","year":"1971"},{"key":"10.1016\/0890-5401(92)90002-W_bib5","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(92)90002-W_bib6","first-page":"171","article-title":"On sparseness, ambiguity and other decision problems for acceptors and transducers","author":"Ibarra","year":"1986","journal-title":"STACS"},{"key":"10.1016\/0890-5401(92)90002-W_bib7","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1137\/0217058","article-title":"Nondeterministic space is closed under complement","volume":"17","author":"Immerman","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(92)90002-W_bib8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01683259","article-title":"New problems complete for nondeterministic log space","volume":"10","author":"Jones","year":"1976","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(92)90002-W_bib9","series-title":"Proceedings 17th Annual Symp. on Theory of Computing","first-page":"464","article-title":"Are search and decision problems computationally equivalent?","author":"Karp","year":"1985"},{"key":"10.1016\/0890-5401(92)90002-W_bib10","author":"Kuich","year":"1988"},{"key":"10.1016\/0890-5401(92)90002-W_bib11","series-title":"Proceedings IEEE 13th Annual Symp. on Switching and Automata Theory","first-page":"125","article-title":"The equivalence problem for regular expressions with squaring requires exponential space","author":"Meyer","year":"1972"},{"key":"10.1016\/0890-5401(92)90002-W_bib12","article-title":"Propri\u00e9t\u00e9s arithm\u00e9tiques et topologiques de series rationalles en variables non commutatives","author":"Reutenauer","year":"1977"},{"key":"10.1016\/0890-5401(92)90002-W_bib13","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1137\/0214044","article-title":"On the equivalence and containment problems for unambiguous regular expressions, regular grammars and finite automata","volume":"14","author":"Stearns","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(92)90002-W_bib14","author":"Stockmeyer","year":"1974"},{"key":"10.1016\/0890-5401(92)90002-W_bib15","series-title":"Proceedings Fifth Annual ACM Symp. on the Theory of Computing","first-page":"1","article-title":"Word problems requiring exponential time","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/0890-5401(92)90002-W_bib16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF00299636","article-title":"The method of forced enumeration for nondeterministic automata","volume":"29","author":"Szelepcs\u00e9nyi","year":"1988","journal-title":"Acta Inform."},{"key":"10.1016\/0890-5401(92)90002-W_bib17","first-page":"620","article-title":"On the degree of ambiguity of finite automata","volume":"Vol. 233","author":"Weber","year":"1986"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290002W?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290002W?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:28Z","timestamp":1548879928000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290002W"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["089054019290002W"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90002-w","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}