{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:31:51Z","timestamp":1736314311194,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540564330"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030389","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T15:32:44Z","timestamp":1138203164000},"page":"118-131","source":"Crossref","is-referenced-by-count":15,"title":["A polynomial time algorithm for finding finite unions of tree pattern languages"],"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","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"D. Angluin. Finding common patterns 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"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Finding common patterns to a set of strings. Journal of Computer and System Sciences, Vol. 21, pp. 46\u201362, 1980.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"D. Angluin. Inductive inference of formal languages from positive data. Information and Control, Vol. 45, pp. 117\u2013135, 1980.","journal-title":"Information and Control"},{"key":"4_CR4","unstructured":"H. Arimura, T. Shinohara, and S. Otsuki. Polynomial time inference of unions of tree pattern languages. In Proceedings of the Second Workshop on Algorithmic Learning Theory, pp. 105\u2013114, 1991. to appear in IEICE trans. Inf. & Syst, 1992, printed in Japan."},{"key":"4_CR5","first-page":"465","volume":"17","author":"K.P. Jantke","year":"1981","unstructured":"K.P. Jantke and H-R. Beick. Combining postulates of naturalness in inductive inference. Elektron. Informationsverarb. Kybern., Vol. 17, pp. 465\u2013484, 1981.","journal-title":"Elektron. Informationsverarb. Kybern."},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis. Logic programming and parallel complexity. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 547\u2013585. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50018-X"},{"key":"4_CR7","first-page":"301","volume":"3","author":"J-L. Lassez","year":"1986","unstructured":"J-L. Lassez and K. Marriott. Explicit representation of terms defined by counter examples. Journal of Automated Reasoning, Vol. 3, pp. 301\u2013317, 1986.","journal-title":"Journal of Automated Reasoning"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"J-L. Lassez, M.J. Maher, and K. Marriott. Unification revisited. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pp. 587\u2013625. Morgan Kaufmann, 1988.","DOI":"10.1016\/B978-0-934613-40-8.50019-1"},{"issue":"No.4","key":"4_CR9","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 pattern languages. New Generation Computing, Vol. 8, No. 4, pp. 361\u2013370, 1991.","journal-title":"New Generation Computing"},{"key":"4_CR10","unstructured":"Y. Mukouchi. Characterization of pattern languages. In Proceedings of the Second Workshop on Algorithmic Learning Theory, pp. 93\u2013104, Tokyo, 1991."},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"L. Pitt. Inductive inference, DFAs, and computational complexity. In K. P. Jantke, editor, Proceedings of International Workshop on Analogical and Inductive Inference, pp. 18\u201344, 1989. Lecture Notes in Computer Science 397.","DOI":"10.1007\/3-540-51734-0_50"},{"key":"4_CR12","unstructured":"G. Plotkin. A note on inductive generalization. In B. Meltzer and D. Mitchie, editors, Machine Intelligence, volume 5, pp. 153\u2013163. Edinburgh University Press, 1970."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"83","DOI":"10.5109\/13347","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":"4_CR14","doi-asserted-by":"crossref","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"},{"key":"4_CR15","unstructured":"K. Wright. Inductive Inference of Pattern Languages. PhD thesis, University of Pittsburgh, 1989."}],"container-title":["Lecture Notes in Computer Science","Nonmonotonic and Inductive Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030389.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T11:57:52Z","timestamp":1736251072000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030389"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540564330"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0030389","relation":{},"subject":[]}}