{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T12:40:22Z","timestamp":1561380022695},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540577850","type":"print"},{"value":"9783540483328","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57785-8_178","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:21:06Z","timestamp":1330262466000},"page":"647-660","source":"Crossref","is-referenced-by-count":15,"title":["Finding minimal generalizations for unions of pattern languages and its application to inductive inference from positive data"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Arimura","sequence":"first","affiliation":[]},{"given":"Takeshi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Setsuko","family":"Otsuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"52_CR1","unstructured":"S. Arikawa, S. Kuhara, S. Miyano, A. Shinohara, and T. Shinohara. A learning algorithm for elementary formal systems and its experiments on identification of transmembrane domains. In Proc. of the 25th Hawaii International Conference on System Sciences, pp. 675\u2013684, 1992.","DOI":"10.1109\/HICSS.1992.183220","doi-asserted-by":"crossref"},{"key":"52_CR2","unstructured":"D. Angluin. Finding patterns common to a set of strings. In Proceedings of the 11th Annual Symposium on Theory of Computing, pp. 130\u2013141, 1979.","DOI":"10.1145\/800135.804406","doi-asserted-by":"crossref"},{"key":"52_CR3","first-page":"426","volume":"E75-D","author":"H. Arimura","year":"1992","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time inference of unions of two tree pattern languages. IEICE Trans. Inf. & Syst., E75-D, pp. 426\u2013434, 1992.","journal-title":"IEICE Trans. Inf. & Syst."},{"key":"52_CR4","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. A polynomial time algorithm for finding finite unions of tree pattern languages. In Proceedings of the Second International Workshop on Nonmonotonic and Inductive Logic, pp. 118\u2013131. LNAI 659, Springer, 1993.","DOI":"10.1007\/BFb0030389","doi-asserted-by":"crossref"},{"key":"52_CR5","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"S. Arikawa, T. Shinohara, and A. Yamamoto. Learning elementary formal systems. Theoretical Computer Science, Vol. 95, pp. 97\u2013113, 1992.","journal-title":"Theoretical Computer Science"},{"key":"52_CR6","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"E.M. Gold. Languages identification in the limit. Information and Control, Vol. 10, pp. 447\u2013474, 1967.","journal-title":"Information and Control"},{"key":"52_CR7","unstructured":"P. D. Laird. Learning from good and bad data. Kluwer Academic, 1988.","DOI":"10.1007\/978-1-4613-1685-5","doi-asserted-by":"crossref"},{"issue":"No.4","key":"52_CR8","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF03037093","volume":"8","author":"S. Lange","year":"1991","unstructured":"S. Lange and R. Wiehagen. Polynomial-time inference of arbitrary pattern languages. New Generation Computing, Vol. 8, No. 4, pp. 361\u2013370, 1991.","journal-title":"New Generation Computing"},{"key":"52_CR9","unstructured":"S. Miyano, A. Shinohara, and T. Shinohara. Which classes of elementary formal systems are polynomial-time learnable? In S. Arikawa, A. Maruoka, and T. Sato, editors, Proceedings of the Second Workshop on Algorithmic Learning Theory, pp. 139\u2013150, 1991."},{"key":"52_CR10","unstructured":"Y. Mukouchi. Characterization of pattern languages. IEICE Trans. Inf. and Syst., Vol. E75-D, No. 7, 1992."},{"key":"52_CR11","unstructured":"R. Nix. Editing by example. Technical Report 280, Department of Computer Science, Yale University, 1983."},{"key":"52_CR12","unstructured":"G. Plotkin. A note on inductive generalization. In B. Meltzer and D. Mitchie, editors, Machine Intelligence, volume 5, pp. 153\u2013163. Edinburgh Univ. Press, 1970."},{"key":"52_CR13","unstructured":"E. Y. Shapiro. Inductive inference of theories from facts. Technical Report 192, Yale University, Department of Computer Science, 1981."},{"key":"52_CR14","unstructured":"T. Shinohara. Polynomial time inference of extended regular pattern languages. In RIMS Symposia on Software Science and Engineering, pp. 115\u2013127. LNCS 147, Springer, 1982.","DOI":"10.1007\/3-540-11980-9_19","doi-asserted-by":"crossref"},{"key":"52_CR15","unstructured":"T. Shinohara. Polynomial time inference of pattern languages and its applications. In Proceedings of the 7th IBM Symposium on Mathematical Foundations of Computer Science, pp. 191\u2013209, 1982."},{"key":"52_CR16","first-page":"83","volume":"20","author":"T. Shinohara","year":"1983","unstructured":"T. Shinohara. Inferring unions of two pattern languages. Bulletin of Informatics and Cybernetics, Vol. 20, pp. 83\u201388, 1983.","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"52_CR17","unstructured":"R. M. Smullyan. Theory of Formal Systems. Princeton Univ. Press, 1961.","DOI":"10.1515\/9781400882007","doi-asserted-by":"crossref"},{"key":"52_CR18","unstructured":"A. Salomaa, K. Salomaa, and Sheng Y. Inclusion is undecidable for pattern languages. In Proc. 20th ICALP, 1993."},{"issue":"No.1","key":"52_CR19","first-page":"125","volume":"E75-D","author":"N Tanida","year":"1992","unstructured":"N Tanida and T. Yokomori. Polynomial-time identification of strictly regular languages in the limit. IEICE Trans. Inf. and Syst., Vol. E75-D, No. 1, pp. 125\u2013132, 1992.","journal-title":"IEICE Trans. Inf. and Syst."},{"issue":"No.11","key":"52_CR20","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"L. G. Valiant. A theory of the learnable. Comm. ACM, Vol. 27, No. 11, pp. 1134\u20131142, 1984.","journal-title":"Comm. ACM"},{"key":"52_CR21","unstructured":"K. Wright. Inductive Inference of Pattern Languages. PhD thesis, University of Pittsburgh, 1989."},{"key":"52_CR22","unstructured":"K. Wright. Identification of unions of languages drawn from an identifiable class. In Proceedings of the 2nd Annual Workshop on Computational Learning Theory, pp. 328\u2013333, 1989.","DOI":"10.1016\/B978-0-08-094829-4.50026-X","doi-asserted-by":"crossref"}],"container-title":["Lecture Notes in Computer Science","STACS 94"],"original-title":[],"link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/3-540-57785-8_178","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T12:02:19Z","timestamp":1561377739000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540577850","9783540483328"],"references-count":22,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-57785-8_178","relation":{"cites":[]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}]}}