{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T02:04:15Z","timestamp":1768269855869,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,7,1]],"date-time":"1994-07-01T00:00:00Z","timestamp":773020800000},"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":6956,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,7]]},"DOI":"10.1016\/0304-3975(94)90033-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:47:37Z","timestamp":1027640857000},"page":"337-367","source":"Crossref","is-referenced-by-count":15,"title":["The inference of tree languages from finite samples: an algebraic approach"],"prefix":"10.1016","volume":"129","author":[{"given":"Timo","family":"Knuutila","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Magnus","family":"Steinby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90033-7_BIB1","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/322326.322334","article-title":"Inference of reversible languages","volume":"29","author":"Angluin","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90033-7_BIB2","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":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(94)90033-7_BIB3","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1972.5009015","article-title":"On the synthesis of finite state machines from samples of their behavior","volume":"C-21","author":"Biermann","year":"1972","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(94)90033-7_BIB4","first-page":"293","article-title":"A note on the k-tail method of tree grammar inference","volume":"SMC-7","author":"Brayer","year":"1977","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/0304-3975(94)90033-7_BIB5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8853-1","article-title":"Finite Automata, their Algebras and Grammars","author":"B\u00fcchi","year":"1989"},{"key":"10.1016\/0304-3975(94)90033-7_BIB6","series-title":"A Course in Universal Algebra","author":"Burris","year":"1981"},{"key":"10.1016\/0304-3975(94)90033-7_BIB7","series-title":"Universal Algebra","author":"Cohn","year":"1981"},{"key":"10.1016\/0304-3975(94)90033-7_BIB8","series-title":"Syntactic Pattern Recognition and Applications","author":"Fu","year":"1982"},{"key":"10.1016\/0304-3975(94)90033-7_BIB9","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF00979871","article-title":"Inference of tree automata from sample set of trees","volume":"13","author":"Fukuda","year":"1984","journal-title":"Internat. J. Comput. Inform. Sci."},{"key":"10.1016\/0304-3975(94)90033-7_BIB10","doi-asserted-by":"crossref","first-page":"920","DOI":"10.1109\/34.57687","article-title":"Inference of k-testable languages in the strict sense and application to syntactic pattern recognition","volume":"PAMI-12","author":"Garci\u00e1","year":"1990","journal-title":"IEEE Trans. Pattern Anal. and Machine Intelligence"},{"key":"10.1016\/0304-3975(94)90033-7_BIB11","series-title":"Tree Automata","author":"G\u00e9cseg","year":"1984"},{"key":"10.1016\/0304-3975(94)90033-7_BIB12","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00975630","article-title":"An algorithm for the inference of tree grammars","volume":"5","author":"Gonzalez","year":"1976","journal-title":"Internat. J. Comput. and Inform. Sci."},{"key":"10.1016\/0304-3975(94)90033-7_BIB13","series-title":"Syntactic Pattern Recognition: An Introduction","author":"Gonzalez","year":"1978"},{"key":"10.1016\/0304-3975(94)90033-7_BIB14","series-title":"Universal Algebra","author":"Gr\u00e4tzer","year":"1979"},{"key":"10.1016\/0304-3975(94)90033-7_BIB15","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/322290.322295","article-title":"Pattern matching in trees","volume":"29","author":"Hoffmann","year":"1982","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)90033-7_BIB16","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1109\/ICSMC.1988.754345","article-title":"Inference methods for tree automata from sample set of trees","author":"Kamata","year":"1988","journal-title":"Proc. 1988 IEEE Internat. Conf. on Systems, Man and Cybernetics"},{"key":"10.1016\/0304-3975(94)90033-7_BIB17","series-title":"Proc. 1992 IAPR Internat. Workshop on Structural and Syntactic Pattern Recognition","article-title":"Inference of k-testable tree languages","author":"Knuutila","year":"1992"},{"key":"10.1016\/0304-3975(94)90033-7_BIB18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TPAMI.1981.4767101","article-title":"Derivatives of tree sets with applications to grammatical inference","volume":"PAMI-3","author":"Levine","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Machine Intelligence"},{"key":"10.1016\/0304-3975(94)90033-7_BIB19","series-title":"Structural Methods in Pattern Recognition","author":"Miclet","year":"1986"},{"key":"10.1016\/0304-3975(94)90033-7_BIB20","series-title":"Inductive Acquisition of Expert Knowledge","author":"Muggleton","year":"1990"},{"key":"10.1016\/0304-3975(94)90033-7_BIB21","doi-asserted-by":"crossref","first-page":"982","DOI":"10.1109\/TSMC.1987.6499309","article-title":"Inference of regular grammars via skeletons","volume":"SMC-17","author":"Radhakrishnan","year":"1987","journal-title":"IEEE Trans. Systems Man Cybernet."},{"key":"10.1016\/0304-3975(94)90033-7_BIB22","series-title":"Les Arbres en Alg\u00e9bre et en Programmation","article-title":"Syntactic algebras and varieties of recognizable sets","author":"Steinby","year":"1979"},{"key":"10.1016\/0304-3975(94)90033-7_BIB23","first-page":"360","article-title":"Some algebraic aspects of recognizability and rationality","volume":"Vol. 117","author":"Steinby","year":"1981"},{"key":"10.1016\/0304-3975(94)90033-7_BIB24","first-page":"444","article-title":"Tree language problems in pattern recognition theory","volume":"Vol. 380","author":"Steinby","year":"1989"},{"key":"10.1016\/0304-3975(94)90033-7_BIB25","series-title":"Proc. 9th Colloq. on Trees in Algebra and Programming","first-page":"31","article-title":"Logical aspects in the study of tree languages","author":"Thomas","year":"1984"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900337?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594900337?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:27:49Z","timestamp":1555115269000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594900337"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,7]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,7]]}},"alternative-id":["0304397594900337"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90033-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,7]]}}}