{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:40:52Z","timestamp":1742978452947,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_5","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"57-70","source":"Crossref","is-referenced-by-count":2,"title":["Relevant Representations for the Inference of Rational Stochastic Tree Languages"],"prefix":"10.1007","author":[{"given":"Fran\u00e7ois","family":"Denis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9douard","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amaury","family":"Habrard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fa\u00efssal","family":"Ouardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Tommasi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-540-75225-7_21","volume-title":"Algorithmic Learning Theory","author":"F. Denis","year":"2007","unstructured":"Denis, F., Habrard, A.: Learning rational stochastic tree languages. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol.\u00a04754, pp. 242\u2013256. Springer, Heidelberg (2007)"},{"issue":"5","key":"5_CR2","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"22","author":"T. Booth","year":"1973","unstructured":"Booth, T., Thompson, R.: Applying probabilistic measures to abstract languages. IEEE Transactions on Computers\u00a022(5), 442\u2013450 (1973)","journal-title":"IEEE Transactions on Computers"},{"issue":"4","key":"5_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/356827.356829","volume":"12","author":"C.S. Wetherell","year":"1980","unstructured":"Wetherell, C.S.: Probabilistic languages: A review and some open questions. ACM Comput. Surv.\u00a012(4), 361\u2013379 (1980)","journal-title":"ACM Comput. Surv."},{"key":"5_CR4","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., L\u00f6ding, C., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007) (release October 12, 2007), http:\/\/tata.gforge.inria.fr\/"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(82)90019-6","volume":"18","author":"J. Berstel","year":"1982","unstructured":"Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoretical Computer Science\u00a018, 115\u2013148 (1982)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"5_CR6","first-page":"219","volume":"8","author":"Z. \u00c9sik","year":"2003","unstructured":"\u00c9sik, Z., Kuich, W.: Formal tree series. Journal of Automata, Languages and Combinatorics\u00a08(2), 219\u2013285 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Denis, F., Esposito, Y.: Rational stochastic languages. Technical report, LIF - Universit\u00e9 de Provence (2006), http:\/\/hal.ccsd.cnrs.fr\/ccsd-00019728","DOI":"10.1007\/11776420_22"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Denis, F., Gilbert, E., Habrard, A., Ouardi, F., Tommasi, M.: Relevant representations for the inference of rational stochastic tree languages. Technical report, LIF, LIFL, and INRIA (2008), http:\/\/hal.archives-ouvertes.fr\/hal-00293511\/en\/","DOI":"10.1007\/978-3-540-88009-7_5"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/11776420_22","volume-title":"Learning theory","author":"F. Denis","year":"2006","unstructured":"Denis, F., Esposito, Y., Habrard, A.: Learning rational stochastic languages. In: Lugosi, G., Simon, H.U. (eds.) Learning theory. LNCS, pp. 274\u2013288. Springer, Heidelberg (2006)"},{"issue":"2","key":"5_CR10","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computional Linguistics\u00a021(2), 165\u2013201 (1995)","journal-title":"Computional Linguistics"},{"key":"5_CR11","unstructured":"Br\u00fcggemann-Klein, A., Murata, M., Wood, D.: Regular tree and regular hedge languages over unranked alphabets. Technical report, Hong Kong University Theoretical Computer Science Center, Version 1 (2001)"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-25979-4_8","volume-title":"Rewriting Techniques and Applications","author":"J. Carme","year":"2004","unstructured":"Carme, J., Niehren, J., Tommasi, M.: Querying unranked trees with stepwise tree automata. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 105\u2013118. Springer, Heidelberg (2004)"},{"key":"5_CR13","unstructured":"Droste, M., Vogler, H.: Weighted logics for XML (manuscript, 2007), http:\/\/www.orchid.inf.tu-dresden.de\/gdp\/monographs\/r20.ps"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:46:01Z","timestamp":1738370761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}