{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T14:13:57Z","timestamp":1676470437530},"reference-count":16,"publisher":"World Scientific Pub Co Pte Lt","issue":"07","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p> We introduce E-equivalence, which is a straightforward generalization of almost-equivalence. While almost-equivalence asks for ordinary equivalence up to a finite number of exceptions, in E-equivalence these exceptions or errors must belong to a (regular) set E. The computational complexity of deterministic finite automata (DFAs) minimization problems and their variants w.r.t. almost- and E-equivalence are studied. We show that there is a significant difference in the complexity of problems related to almost-equivalence, and those related to E-equivalence. Moreover, since hyper-minimal and E-minimal automata are not necessarily unique (up to isomorphism as for minimal DFAs), we consider the problem of counting the number of these minimal automata. <\/jats:p>","DOI":"10.1142\/s0129054113400327","type":"journal-article","created":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T02:16:43Z","timestamp":1393467403000},"page":"1083-1097","source":"Crossref","is-referenced-by-count":4,"title":["FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS"],"prefix":"10.1142","volume":"24","author":[{"given":"MARKUS","family":"HOLZER","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SEBASTIAN","family":"JAKOBI","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen, Arndtstr. 2, 35392 Giessen, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2014,2,26]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90252-O"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410900684X"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90002-W"},{"key":"p_7","first-page":"356","author":"Gawrychowski P.","year":"2009","journal-title":"Slovakia"},{"key":"p_8","first-page":"327","author":"Gawrychowski P.","year":"2011","journal-title":"Poland"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1145\/203610.203611"},{"key":"p_10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.029"},{"key":"p_11","first-page":"189","author":"Hopcroft J.","year":"1971","journal-title":"New York"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1137\/0217058"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80050-X"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01683259"},{"key":"p_16","doi-asserted-by":"publisher","DOI":"10.1137\/0218073"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111009094"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1007\/BF00299636"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T15:00:27Z","timestamp":1565103627000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":16,"journal-issue":{"issue":"07","published-online":{"date-parts":[[2014,2,26]]},"published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1142\/S0129054113400327"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400327","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11]]}}}