{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T05:13:56Z","timestamp":1737695636601,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540754138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75414-5_14","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:22:54Z","timestamp":1196940174000},"page":"218-235","source":"Crossref","is-referenced-by-count":7,"title":["Learning Deterministically Recognizable Tree Series \u2014 Revisited"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maletti","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Inform. and Control\u00a045(2), 117\u2013135 (1980)","journal-title":"Inform. and Control"},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inform. and Comput.\u00a075(2), 87\u2013106 (1987)","journal-title":"Inform. and Comput."},{"issue":"4","key":"14_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02(4), 319\u2013342 (1987)","journal-title":"Machine Learning"},{"key":"14_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/3-540-45583-3_3","volume-title":"Algorithmic Learning Theory","author":"D. Angluin","year":"2001","unstructured":"Angluin, D.: Queries revisited. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS (LNAI), vol.\u00a02225, pp. 12\u201331. Springer, Heidelberg (2001)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-45007-6_11","volume-title":"Developments in Language Theory","author":"B. Borchardt","year":"2003","unstructured":"Borchardt, B.: The Myhill-Nerode theorem for recognizable tree series. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 146\u2013158. Springer, Heidelberg (2003)"},{"issue":"4","key":"14_CR6","first-page":"509","volume":"16","author":"B. Borchardt","year":"2004","unstructured":"Borchardt, B.: A pumping lemma and decidability problems for recognizable tree series. Acta Cybernet.\u00a016(4), 509\u2013544 (2004)","journal-title":"Acta Cybernet."},{"unstructured":"B. Borchardt. The Theory of Recognizable Tree Series. PhD thesis, Technische Universit\u00e4t Dresden (2005)","key":"14_CR7"},{"issue":"3","key":"14_CR8","first-page":"417","volume":"8","author":"B. Borchardt","year":"2003","unstructured":"Borchardt, B., Vogler, H.: Determinization of finite state weighted tree automata. J. Autom. Lang. Combin.\u00a08(3), 417\u2013463 (2003)","journal-title":"J. Autom. Lang. Combin."},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45007-6_22","volume-title":"Developments in Language Theory","author":"F. Drewes","year":"2003","unstructured":"Drewes, F., H\u00f6gberg, J.: Learning a regular tree language from a teacher. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 279\u2013291. Springer, Heidelberg (2003)"},{"unstructured":"Drewes, F., H\u00f6gberg, J.: Extensions of a MAT learner for regular tree languages. In: Proc. 23rd Annual Workshop of the Swedish Artificial Intelligence Society, Ume\u00e5 University, pp. 35\u201344 (2006)","key":"14_CR10"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00224-005-1233-3","volume":"40","author":"F. Drewes","year":"2007","unstructured":"Drewes, F., H\u00f6gberg, J.: Query learning of regular tree languages: How to avoid dead states. Theory of Comput. Syst.\u00a040(2), 163\u2013185 (2007)","journal-title":"Theory of Comput. Syst."},{"unstructured":"Drewes, F., Vogler, H.: Learning deterministically recognizable tree series. J. Automata, Languages and Combinatorics, (to appear, 2007)","key":"14_CR12"},{"doi-asserted-by":"crossref","unstructured":"Eisner, J.: Simpler and more general minimization for weighted finite-state automata. In: Human Language Technology Conf. of the North American Chapter of the Association for Computational Linguistics, pp. 64\u201371 (2003)","key":"14_CR13","DOI":"10.3115\/1073445.1073454"},{"key":"14_CR14","volume-title":"Tree Automata","author":"F. G\u00e9cseg","year":"1984","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3, Budapest (1984)"},{"key":"14_CR15","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Handbook of Formal Languages, ch. 1, vol.\u00a03, pp. 1\u201368. Springer, Heidelberg (1997)"},{"issue":"5","key":"14_CR16","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"E.M. Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inform. and Control\u00a010(5), 447\u2013474 (1967)","journal-title":"Inform. and Control"},{"key":"14_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/11872436_22","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Habrard","year":"2006","unstructured":"Habrard, A., Oncina, J.: Learning multiplicity tree automata. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 268\u2013280. Springer, Heidelberg (2006)"},{"key":"14_CR18","series-title":"ACM Distinguished Dissertation","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E.Y. Shapiro","year":"1983","unstructured":"Shapiro, E.Y.: Algorithmic Program Debugging. ACM Distinguished Dissertation. MIT Press, Cambridge (1983)"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75414-5_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T08:07:47Z","timestamp":1737619667000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75414-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540754138"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75414-5_14","relation":{},"subject":[]}}