{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:44:51Z","timestamp":1743029091232,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_27","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"295-297","source":"Crossref","is-referenced-by-count":0,"title":["Learning of Regular \u03c9-Tree Languages"],"prefix":"10.1007","author":[{"given":"M.","family":"Jayasrirani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. H.","family":"Begam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. G.","family":"Thomas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. Gecseg","year":"1997","unstructured":"Gecseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"key":"27_CR2","first-page":"225","volume-title":"Tree Automata and Languages","author":"A. Saoudi","year":"1992","unstructured":"Saoudi, A.: Rational and recognizable infinite tree sets. In: Tree Automata and Languages, pp. 225\u2013234. Elsevier Science, Amsterdam (1992)"},{"key":"27_CR3","first-page":"157","volume-title":"Proc. EuroColt, 1993","author":"A. Saoudi","year":"1994","unstructured":"Saoudi, A., Yokomori, T.: Learning local and recognizable \u03c9-languages and Monadic Logic Programs. In: Proc. EuroColt, 1993, pp. 157\u2013169. Oxford Univ. Press, Oxford (1994)"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:49:40Z","timestamp":1715312980000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}