{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:58:49Z","timestamp":1725566329688},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233565"},{"type":"electronic","value":"9783540302155"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30215-5_29","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T19:15:09Z","timestamp":1285096509000},"page":"380-394","source":"Crossref","is-referenced-by-count":0,"title":["Learning Languages Generated by Elementary Formal Systems and Its Application to SH Languages"],"prefix":"10.1007","author":[{"given":"Yasuhito","family":"Mukouchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masako","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"29_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding a pattern common to a set of strings. Journal of Computer and System Sciences\u00a021(1), 46\u201362 (1980)","journal-title":"Journal of Computer and System Sciences"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Information and Control\u00a045, 117\u2013135 (1980)","journal-title":"Information and Control"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.2206\/kyushumfs.24.47","volume":"24","author":"S. Arikawa","year":"1970","unstructured":"Arikawa, S.: Elementary formal systems and formal languages \u2013 simple formal systems. Memoirs of Faculty of Science, Kyushu University, Series A, Mathematics\u00a024, 47\u201375 (1970)","journal-title":"Memoirs of Faculty of Science, Kyushu University, Series A, Mathematics"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0304-3975(92)90068-Q","volume":"95","author":"S. Arikawa","year":"1992","unstructured":"Arikawa, S., Shinohara, T., Yamamoto, A.: Learning elementary formal systems. Theoretical Computer Science\u00a095, 97\u2013113 (1992)","journal-title":"Theoretical Computer Science"},{"key":"29_CR5","first-page":"227","volume":"15","author":"S. Arikawa","year":"1995","unstructured":"Arikawa, S., Sato, M., Shinohara, A., Shinohara, T.: Developments in computational learning and discovery theory within the framework of elementary formal systems. Machine Intelligence\u00a015, 227\u2013247 (1995)","journal-title":"Machine Intelligence"},{"key":"29_CR6","first-page":"39","volume":"5","author":"H. Arimura","year":"1994","unstructured":"Arimura, H., Fujino, R., Shinohara, T., Arikawa, S.: Protein motif discovery from positive examples by minimal multiple generalization over regular patterns. Genome Informatics\u00a05, 39\u201348 (1994)","journal-title":"Genome Informatics"},{"key":"29_CR7","unstructured":"Garc\u00b4\u0131a, P., Vidal, E., Oncina, J.: Learning locally testable languages in the strict sense. In: Proceedings of the 1st International Workshop on Algorithmic Learning Theory, pp. 325\u2013338 (1990)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010, 447\u2013474 (1967)","journal-title":"Information and Control"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","volume":"49","author":"T. Head","year":"1987","unstructured":"Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bulletin of Mathematical Biology\u00a049, 737\u2013759 (1987)","journal-title":"Bulletin of Mathematical Biology"},{"issue":"1-3","key":"29_CR10","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0166-218X(98)00053-5","volume":"87","author":"T. Head","year":"1998","unstructured":"Head, T.: Splicing representations of strictly locally testable languages. Discrete Applied Mathematics\u00a087(1-3), 139\u2013147 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Lange, S., Zeugmann, T.: Language learning in dependence on the space of hypotheses. In: Proceedings of the 6th Annual ACM Conference on Computational Learning Theory, pp. 127\u2013136 (1993)","DOI":"10.1145\/168304.168320"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/S0304-3975(02)00418-8","volume":"298","author":"S. Lange","year":"2003","unstructured":"Lange, S., Grieser, G., Jantke, K.P.: Advanced elementary formal systems. Theoretical Computer Science\u00a0298(1), 51\u201370 (2003)","journal-title":"Theoretical Computer Science"},{"key":"29_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-96826-6","volume-title":"Foundations of logic programming","author":"J.W. Lloyd","year":"1984","unstructured":"Lloyd, J.W.: Foundations of logic programming. Springer, Heidelberg (1984)"},{"key":"29_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0166-218X(98)00002-X","volume":"84","author":"A. Mateescu","year":"1998","unstructured":"Mateescu, A., P\u0103un, G., Rozenberg, G., Salomaa, A.: Simple splicing systems. Discrete Applied Mathematics\u00a084, 145\u2013163 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Motoki, T., Shinohara, T., Wright, K.: The correct definition of finite elasticity: corrigendum to identification of unions. In: Proceedings of the 4th Annual ACM Workshop on Computational Learning Theory, pp. 375\u2013375 (1991)","DOI":"10.1016\/B978-1-55860-213-7.50037-7"},{"key":"29_CR16","unstructured":"Mukouchi, Y., Takaishi, R., Sato, M.: : Properties of SH systems and their languages (in preparation)"},{"key":"29_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-36169-3_25","volume-title":"Algorithmic Learning Theory","author":"D. Reidenbach","year":"2002","unstructured":"Reidenbach, D.: A negative result on inductive inference of extended pattern languages. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS (LNAI), vol.\u00a02533, pp. 308\u2013320. Springer, Heidelberg (2002)"},{"issue":"1","key":"29_CR18","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(02)00417-6","volume":"298","author":"H. Sakamoto","year":"2003","unstructured":"Sakamoto, H., Hirata, K., Arimura, H.: Learning elementary formal systems with queries. Theoretical Computer Science\u00a0298(1), 21\u201350 (2003)","journal-title":"Theoretical Computer Science"},{"key":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/3-540-11980-9_19","volume-title":"RIMS Symposium on Software Science and Engineering","author":"T. Shinohara","year":"1983","unstructured":"Shinohara, T.: Polynomial time inference of extended regular pattern languages. In: Goto, E., Nakajima, R., Yonezawa, A., Nakata, I., Furukawa, K. (eds.) RIMS 1982. LNCS, vol.\u00a0147, pp. 115\u2013127. Springer, Heidelberg (1983)"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"9","DOI":"10.5109\/13373","volume":"22","author":"T. Shinohara","year":"1986","unstructured":"Shinohara, T.: Inductive inference of formal systems from positive data. Bulletin of Informatics and Cybernetics\u00a022, 9\u201318 (1986)","journal-title":"Bulletin of Informatics and Cybernetics"},{"key":"29_CR21","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1006\/inco.1994.1006","volume":"108","author":"T. Shinohara","year":"1994","unstructured":"Shinohara, T.: Rich classes inferable from positive data: length-bounded elementary formal systems. Information and Computation\u00a0108, 175\u2013186 (1994)","journal-title":"Information and Computation"},{"issue":"4","key":"29_CR22","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF03037094","volume":"8","author":"T. Shinohara","year":"1991","unstructured":"Shinohara, T.: Inductive inference of monotonic formal systems from positive data. New Generation Computing\u00a08(4), 371\u2013384 (1991)","journal-title":"New Generation Computing"},{"key":"29_CR23","doi-asserted-by":"crossref","DOI":"10.1515\/9781400882007","volume-title":"Theory of formal systems","author":"R.M. Smullyan","year":"1961","unstructured":"Smullyan, R.M.: Theory of formal systems. Princeton University Press, Princeton (1961)"},{"key":"29_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-540-39624-6_8","volume-title":"Algorithmic Learning Theory","author":"J. Uemura","year":"2003","unstructured":"Uemura, J., Sato, M.: Learning of erasing primitive formal systems from positive examples. In: Gavald\u00e1, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol.\u00a02842, pp. 69\u201383. Springer, Heidelberg (2003)"},{"issue":"4","key":"29_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0743-1066(92)90022-U","volume":"13","author":"A. Yamamoto","year":"1992","unstructured":"Yamamoto, A.: Procedural semantics and negative information of elementary formal system. Journal of Logic Programming\u00a013(4), 89\u201398 (1992)","journal-title":"Journal of Logic Programming"},{"key":"29_CR26","doi-asserted-by":"crossref","unstructured":"Yokomori, T., Ishida, N., Kobayashi, S.: Learning local languages and its application to protein \u03b1-chain identification. In: Proceedings of the 27th Hawaii International Conference on System Sciences. 5, pp. 113\u2013122 (1994)","DOI":"10.1109\/HICSS.1994.323560"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Wright, K.: Identification of unions of languages drawn from an identifiable class. In: Proceedings of the 2nd Annual ACM Workshop on Computational Learning Theory, pp. 328\u2013333 (1989)","DOI":"10.1016\/B978-0-08-094829-4.50026-X"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30215-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T00:54:00Z","timestamp":1591923240000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30215-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233565","9783540302155"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30215-5_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}