{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T04:34:29Z","timestamp":1768278869972,"version":"3.49.0"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1984,6,1]],"date-time":"1984-06-01T00:00:00Z","timestamp":454896000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1984,6]]},"DOI":"10.1007\/bf00979871","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T10:21:07Z","timestamp":1105698067000},"page":"177-196","source":"Crossref","is-referenced-by-count":18,"title":["Inference of tree automata from sample set of trees"],"prefix":"10.1007","volume":"13","author":[{"given":"H.","family":"Fukuda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Kamata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1109\/TSMC.1975.5409159","volume":"SMC-5","author":"K. S. Fu","year":"1975","unstructured":"K. S. Fu and T. L. Booth, Grammatical inference: Introduction and survey-Part I,IEEE Trans. on Systems, Man, and Cybernetics,SMC-5(1):95?111 (1975).","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"4","key":"CR2","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TSMC.1975.5408432","volume":"SMC-5","author":"K. S. Fu","year":"1975","unstructured":"K. S. Fu and T. L. Booth, Grammatical inference: Introduction and survey-Part H,IEEE Trans. on Systems, Man, and Cybernetics,SMC-5(4):409?423 (1975).","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1109\/TPAMI.1981.4767101","volume":"PAMI-3","author":"B. Levine","year":"1981","unstructured":"B. Levine, Derivatives of tree sets with application to grammatical inference,IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI-3(3):285?293 (1981).","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TPAMI.1982.4767191","volume":"PAMI-4","author":"B. Levine","year":"1982","unstructured":"B. Levine, The use of tree derivatives and a sample support parameter for inferring tree systems,IEEE Trans. on Pattern Analysis and Machine Intelligence,PAMI-4(1):25?34 (1982).","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"6","key":"CR5","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"C-21","author":"A. W. Bierman","year":"1972","unstructured":"A. W. Bierman and J. A. Felman, On the synthesis of finite-state machines from samples of their behavior,IEEE Trans. on Computers,C-21(6):592?597 (1972).","journal-title":"IEEE Trans. on Computers"},{"issue":"4","key":"CR6","first-page":"293","volume":"SMC-7","author":"J. M. Brayer","year":"1977","unstructured":"J. M. Brayer and K. S. Fu, A note on thek-tail method of tree grammar inference,IEEE Trans. on System, Man, and Cybernetics,SMC-7(4):293?300 (1977).","journal-title":"IEEE Trans. on System, Man, and Cybernetics"},{"issue":"2","key":"CR7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF00975630","volume":"5","author":"R. C. Gonzalez","year":"1976","unstructured":"R. C. Gonzalez, J. J. Edwards, and M. G. Thomason, An algorithm for the inference of tree grammars,Int. J. Comp. Infor. Sci. 5(2):145?164 (1976).","journal-title":"Int. J. Comp. Infor. Sci."},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J. A. Brzozowski","year":"1974","unstructured":"J. A. Brzozowski, Derivatives of regular expressions,J. ACM 11(4):481?494 (1974).","journal-title":"J. ACM"},{"issue":"5","key":"CR9","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1016\/S0019-9958(68)90917-0","volume":"13","author":"W. S. Brainerd","year":"1968","unstructured":"W. S. Brainerd, The minimalization of tree automata,Infor. and Control 13(5):484?491 (1968).","journal-title":"Infor. and Control"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00979871.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00979871\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00979871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T00:50:49Z","timestamp":1556585449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00979871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,6]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,6]]}},"alternative-id":["BF00979871"],"URL":"https:\/\/doi.org\/10.1007\/bf00979871","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,6]]}}}