{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T01:18:18Z","timestamp":1648689498225},"reference-count":17,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":[[1998,5]]},"DOI":"10.1016\/s0020-0190(98)00065-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T20:36:00Z","timestamp":1051130160000},"page":"165-170","source":"Crossref","is-referenced-by-count":1,"title":["On the hardness of approximating the minimum consistent acyclic DFA and decision diagram"],"prefix":"10.1016","volume":"66","author":[{"given":"Shinichi","family":"Shimozono","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kouichi","family":"Hirata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00065-9_BIB1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","article-title":"On the complexity of minimum inference of regular sets","volume":"39","author":"Angluin","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB2","series-title":"Proc. 36th Annual Symposium on Foundations of Computer Science","first-page":"422","article-title":"Free bits, PCPs and non-approximability\u2014towards tight results","author":"Bellare","year":"1995"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB3","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/12.537122","article-title":"Improving the variable ordering of OBDDs is NP-complete","volume":"45","author":"Bollig","year":"1996","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(98)00065-9_BIB4","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","article-title":"Occam's razor","volume":"24","author":"Blumer","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00065-9_BIB5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/136035.136043","article-title":"Symbolic Boolean manipulation with ordered binary-decision diagrams","volume":"24","author":"Bryant","year":"1992","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB6","series-title":"Proc. 6th International Workshop on Algorithmic Learning Theory","first-page":"228","article-title":"Learning ordered binary decision diagrams","author":"Gavald\u00e1","year":"1995"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB7","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(94)00048-4","article-title":"On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs","volume":"50","author":"Gergov","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00065-9_BIB8","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","article-title":"Complexity of automaton identification from given data","volume":"37","author":"Gold","year":"1978","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB9","series-title":"Proc. 12th Annual Symposium on Theoretical Aspects of Computer Science","first-page":"527","article-title":"Lower bounds on learning decision lists and trees","author":"Hancock","year":"1995"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB10","series-title":"Proc. Fifth Scandinavian Workshop on Algorithm Theory","first-page":"112","article-title":"On the hardness of approximating the minimum consistent OBDD problem","author":"Hirata","year":"1996"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB11","series-title":"Proc. 1988 Workshop on Computational Learning Theory","first-page":"359","article-title":"On the learnability of finite automata","author":"Li","year":"1988"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB12","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/48014.63140","article-title":"Computational limitations on learning from examples","volume":"35","author":"Pitt","year":"1988","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1145\/138027.138042","article-title":"The minimum consistent DFA problem cannot be approximated within any polynomial","volume":"40","author":"Pitt","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB14","doi-asserted-by":"crossref","first-page":"1435","DOI":"10.1109\/43.543775","article-title":"On the complexity of minimizing the OBDD size for incompletely specified functions","volume":"15","author":"Sauerhoff","year":"1996","journal-title":"IEEE Trans. C.A.D. Integ. Circuits and Syst."},{"key":"10.1016\/S0020-0190(98)00065-9_BIB15","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0403025","article-title":"On approximate solutions for combinatorial optimization problems","volume":"3","author":"Simon","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0020-0190(98)00065-9_BIB16","article-title":"Hardness of identifying the minimum ordered binary decision diagram","author":"Takenaga","year":"1993"},{"key":"10.1016\/S0020-0190(98)00065-9_BIB17","series-title":"Finite Automata","author":"Trakhtenbrot","year":"1973"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000659?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000659?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:27:55Z","timestamp":1556058475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0020019098000659"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00065-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}