{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T00:24:16Z","timestamp":1649031856717},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2017,4]]},"abstract":"<jats:p> We continue our research on minimization problems and related problems for automata w.r.t. to different error profiles, now considering nondeterministic finite automata (NFAs) as inputs. Here the error profiles are almost-equivalence and E-equivalence. We show that the minimization problems and their underlying equivalence problems become PSPACE-complete in most cases. The obtained results nicely fit to the known ones on ordinary NFA minimization, and show a significant difference to the previously obtained results on deterministic finite state machines. <\/jats:p>","DOI":"10.1142\/s0129054117500150","type":"journal-article","created":{"date-parts":[[2017,5,21]],"date-time":"2017-05-21T22:16:41Z","timestamp":1495405001000},"page":"229-245","source":"Crossref","is-referenced-by-count":0,"title":["More on Minimizing Finite Automata with Errors \u2014 Nondeterministic Machines"],"prefix":"10.1142","volume":"28","author":[{"given":"Markus","family":"Holzer","sequence":"first","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany"}]},{"given":"Sebastian","family":"Jakobi","sequence":"additional","affiliation":[{"name":"Institut f\u00fcr Informatik, Universit\u00e4t Giessen Arndtstr. 2, 35392 Giessen, Germany"}]}],"member":"219","published-online":{"date-parts":[[2017,5,21]]},"reference":[{"key":"p_2","doi-asserted-by":"publisher","DOI":"10.1142\/S012905410900684X"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90198-5"},{"key":"p_5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90002-W"},{"key":"p_6","first-page":"363","author":"Gruber H.","year":"2006","journal-title":"California, USA"},{"key":"p_7","first-page":"114","author":"Gruber H.","year":"2015","journal-title":"Sweden"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054113400327"},{"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\/0207007"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(76)80038-4"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1137\/0222067"},{"key":"p_19","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054117500150","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:58:18Z","timestamp":1565110698000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054117500150"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4]]},"references-count":12,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2017,5,21]]},"published-print":{"date-parts":[[2017,4]]}},"alternative-id":["10.1142\/S0129054117500150"],"URL":"https:\/\/doi.org\/10.1142\/s0129054117500150","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4]]}}}