{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:50:18Z","timestamp":1730296218091,"version":"3.28.0"},"reference-count":11,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981,10]]},"DOI":"10.1109\/sfcs.1981.29","type":"proceedings-article","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T15:49:42Z","timestamp":1217519382000},"page":"74-81","source":"Crossref","is-referenced-by-count":11,"title":["On the equivalence and containment problems for unambiguous regular expressions, grammars, and automata"],"prefix":"10.1109","author":[{"given":"Richard E.","family":"Stearns","sequence":"first","affiliation":[]},{"given":"Harry B.","family":"Hunt","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/321724.321732"},{"key":"ref3","first-page":"529","article-title":"Canonical regular expressions and minimal state graphs for definite events","author":"brzozowski","year":"1963","journal-title":"Proc Symp Mathematical Theory Automata"},{"key":"ref10","first-page":"143","author":"thatcher","year":"1973","journal-title":"Currents in the Theory of Computing"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80038-4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1970.14"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90002-3"},{"journal-title":"Counter-Free Automata","year":"1971","author":"mcnaughton","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(69)80016-2"},{"key":"ref2","volume":"1","author":"aho","year":"1972","journal-title":"The Theory of Parsing Translation and Compiling"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804029"},{"journal-title":"The Design and Analysis of Computer Algorithms","year":"1974","author":"aho","key":"ref1"}],"event":{"name":"22nd Annual Symposium on Foundations of Computer Science","start":{"date-parts":[[1981,10,28]]},"location":"Nashville, TN, USA","end":{"date-parts":[[1981,10,30]]}},"container-title":["22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4568306\/4568307\/04568319.pdf?arnumber=4568319","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T19:22:44Z","timestamp":1489692164000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4568319\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,10]]},"references-count":11,"URL":"https:\/\/doi.org\/10.1109\/sfcs.1981.29","relation":{},"subject":[],"published":{"date-parts":[[1981,10]]}}}