{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:22:32Z","timestamp":1776316952466,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540404347","type":"print"},{"value":"9783540450078","type":"electronic"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45007-6_13","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T14:34:37Z","timestamp":1188311677000},"page":"171-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Residual Finite Tree Automata"],"prefix":"10.1007","author":[{"given":"Julien","family":"Carme","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Gilleron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aur\u00e9lien","family":"Lemay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Terlutte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"13_CR1","unstructured":"[CDG+97]_H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http:\/\/www.grappa.univ-lille3.fr\/tata, 1997."},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"[CGL+03]_J. Carme, R. Gilleron, A. Lemay, A. Terlutte, and M. Tommasi. Residual finite tree automata. Technical report, GRAPPA, 2003.","DOI":"10.1007\/3-540-45007-6_13"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Learning regular languages using rfsa. In ALT 2001, number 2225 in Lecture Notes in Artificial Intelligence. Springer Verlag, 2001.","DOI":"10.1007\/3-540-45583-3_26"},{"issue":"4","key":"13_CR4","doi-asserted-by":"crossref","first-page":"339","DOI":"10.3233\/FUN-2002-51402","volume":"51","author":"F. Denis","year":"2002","unstructured":"F. Denis, A. Lemay, and A. Terlutte. Residual finite state automata. Fundamenta Informaticae, 51(4):339\u2013368, 2002.","journal-title":"Fundamenta Informaticae"},{"key":"13_CR5","first-page":"63","volume":"2484","author":"F. Denis","year":"2002","unstructured":"F. Denis, A. Lemay, and A. Terlutte. some language classes identifiable in the limit from positive data. In ICGI 2002, number 2484 in Lecture Notes in Artificial Intelligence, pages 63\u201376. Springer Verlag, 2002.","journal-title":"ICGI 2002"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Henning Fernau. Learning tree languages from text. In Proc. 15th Annual Conference on Computational Learning Theory, COLT 2002, pages 153\u2013168, 2002.","DOI":"10.1007\/3-540-45435-7_11"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(01)00402-9","volume":"288","author":"S. A. Goldman","year":"2002","unstructured":"Sally A. Goldman and Stephen S. Kwek. On learning unions of pattern languages and tree patterns in the mistake bound model. Theorical Computer Science, 288(2):237\u2013254, 2002.","journal-title":"Theorical Computer Science"},{"key":"13_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":"E.M. Gold. Language identification in the limit. Inform. Control, 10:447\u2013474, 1967.","journal-title":"Inform. Control"},{"key":"13_CR9","unstructured":"F. G\u00e9cseg and M. Steinby. Tree Automata. Akademiai Kiado, 1984."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"F. G\u00e9cseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 1\u201368. Springer Verlag, 1996.","DOI":"10.1007\/978-3-642-59126-6_1"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Ling Liu, Calton Pu, and Wei Han. XWRAP: An XML-enabled wrapper construction system for web information sources. In ICDE, pages 611\u2013621, 2000.","DOI":"10.1109\/ICDE.2000.839475"},{"key":"13_CR12","unstructured":"M. Murata, D. Lee, and M. Mani. \u201cTaxonomy of XML Schema Languages using Formal Language Theory\u201d. In Extreme Markup Languages, Montreal, Canada, 2001."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"F. Neven. Automata, xml and logic. In Proceedings of CSL, pages 2\u201326, 2002.","DOI":"10.1007\/3-540-45793-3_2"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1137\/S0097539789164078","volume":"26","author":"M. Nivat","year":"1997","unstructured":"M. Nivat and A. Podelski. Minimal ascending and descending tree automata. SIAM Journal on Computing, 26(1):39\u201358, February 1997.","journal-title":"SIAM Journal on Computing"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Yasubumi Sakakibara. learning context-free grammars from structural data in polynomial time. Theorical Computer Science, 76:223\u2013242, 1990.","journal-title":"Theorical Computer Science"},{"key":"13_CR16","unstructured":"J.W. Thatcher. Tree automata: an informal survey. In A.V. Aho, editor, Currents in the theory of computing, pages 143\u2013178. Prentice Hall, 1973."},{"key":"13_CR17","unstructured":"Wolfgang Thomas. Logical aspects in the study of tree languages. In Proceedings of the 9th International Colloquium on Trees in Algebra and Programming, CAAP\u2019 84, pages 31\u201350, 1984."},{"key":"13_CR18","first-page":"33","volume":"5","author":"J. Viragh","year":"1981","unstructured":"J. Viragh. Deterministic ascending tree automata. Acta Cybernetica, 5:33\u201342, 1981.","journal-title":"Acta Cybernetica"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45007-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:10:46Z","timestamp":1737396646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45007-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404347","9783540450078"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45007-6_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"18 June 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}