{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:51Z","timestamp":1759637631983},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,8,1]],"date-time":"1987-08-01T00:00:00Z","timestamp":554774400000},"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":9482,"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":[[1987,8]]},"DOI":"10.1016\/0890-5401(87)90026-5","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"91-112","source":"Crossref","is-referenced-by-count":13,"title":["Identification of pattern languages from examples and queries"],"prefix":"10.1016","volume":"74","author":[{"given":"Assaf","family":"Marron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ker-I","family":"Ko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(87)90026-5_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\/0890-5401(87)90026-5_BIB2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","article-title":"Finding patterns common to a set of strings","volume":"21","author":"Angluin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90026-5_BIB3","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","article-title":"A note on the number of queries needed to identify regular languages","volume":"51","author":"Angluin","year":"1981","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(87)90026-5_BIB4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/356914.356918","article-title":"Inductive inference: Theory and methods","volume":"15","author":"Angluin","year":"1983","journal-title":"Comput. Surveys"},{"key":"10.1016\/0890-5401(87)90026-5_BIB5","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","article-title":"Language identification in the limit","volume":"10","author":"Gold","year":"1967","journal-title":"Inform. and Control"},{"key":"10.1016\/0890-5401(87)90026-5_BIB6","doi-asserted-by":"crossref","first-page":"621","DOI":"10.1016\/0005-1098(72)90033-7","article-title":"System identification via state characterization","volume":"8","author":"Gold","year":"1972","journal-title":"Automatica"},{"key":"10.1016\/0890-5401(87)90026-5_BIB7","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\/0890-5401(87)90026-5_BIB8","author":"Hopcroft","year":"1979"},{"key":"10.1016\/0890-5401(87)90026-5_BIB9","series-title":"Proceedings, Symposium of Theoretical Aspects of Computer Science","first-page":"314","article-title":"Polynomial time inference of general pattern languages","volume":"Vol. 166","author":"Jantke","year":"1984"},{"key":"10.1016\/0890-5401(87)90026-5_BIB10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0022-0000(87)90006-7","article-title":"A note on the two-variable pattern-finding problem","volume":"34","author":"Ko","year":"1987","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0890-5401(87)90026-5_BIB11","volume":"Vol. 17","author":"Lothaire","year":"1983"},{"key":"10.1016\/0890-5401(87)90026-5_BIB12","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0096-0551(78)90006-1","article-title":"A solution of the syntactical induction-inference problem for regular languages","volume":"3","author":"Pao","year":"1978","journal-title":"Comput. Lang."},{"key":"10.1016\/0890-5401(87)90026-5_BIB13","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","article-title":"A theory of the learnable","volume":"27","author":"Valiant","year":"1984","journal-title":"Comm. ACM"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900265?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0890540187900265?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:26:06Z","timestamp":1548879966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0890540187900265"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,8]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,8]]}},"alternative-id":["0890540187900265"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(87)90026-5","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1987,8]]}}}