{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:10:48Z","timestamp":1725491448836},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540732075"},{"type":"electronic","value":"9783540732082"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-73208-2_23","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T03:58:11Z","timestamp":1189569491000},"page":"229-241","source":"Crossref","is-referenced-by-count":9,"title":["Bisimulation Minimisation for Weighted Tree Automata"],"prefix":"10.1007","author":[{"given":"Johanna","family":"H\u00f6gberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Maletti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"May","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An n\n                  log\n                  n algorithm for minimizing states in a finite automaton. In: Kohavi, Z. (ed.) Theory of Machines and Computations, Academic Press, London (1971)"},{"key":"23_CR2","first-page":"125","volume-title":"Proc. 13th Annual Symp. Foundations of Computer Science","author":"A.R. Meyer","year":"1972","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: Proc. 13th Annual Symp. Foundations of Computer Science, pp. 125\u2013129. IEEE Computer Society, Los Alamitos (1972)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-3-540-31856-9_33","volume-title":"STACS 2005","author":"G. Gramlich","year":"2005","unstructured":"Gramlich, G., Schnitger, G.: Minimizing nfas and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 399\u2013411. Springer, Heidelberg (2005)"},{"key":"23_CR4","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1982","unstructured":"Milner, R.: A Calculus of Communicating Systems. Springer Verlag, Heidelberg (1982)"},{"key":"23_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"},{"key":"23_CR6","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree Automata. Akad\u00e9miai Kiad\u00f3 (1984)"},{"key":"23_CR7","first-page":"1","volume-title":"Handbook of Formal Languages","author":"F. G\u00e9cseg","year":"1997","unstructured":"G\u00e9cseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a03, pp. 1\u201368. Springer Verlag, Heidelberg (1997)"},{"key":"23_CR8","series-title":"Pure and Applied Mathematics","volume-title":"Automata, Languages, and Machines","year":"1974","unstructured":"Eilenberg, S. (ed.): Automata, Languages, and Machines. Pure and Applied Mathematics, vol.\u00a0A.59. Academic Press, London (1974)"},{"key":"23_CR9","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata (unpublished, 2007)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Backward and forward bisimulation minimisation of tree automata. Technical Report ISI-TR-633, U. So. California (2007)","DOI":"10.1007\/978-3-540-76336-9_12"},{"key":"23_CR11","first-page":"170","volume":"47","author":"D. Kozen","year":"1992","unstructured":"Kozen, D.: On the Myhill-Nerode theorem for trees. Bulletin of the EATCS\u00a047, 170\u2013173 (1992)","journal-title":"Bulletin of the EATCS"},{"key":"23_CR12","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 Verlag, Heidelberg (2003)"},{"key":"23_CR13","unstructured":"Drewes, F., Vogler, H.: Learning deterministically recognizable tree series. J. Automata, Languages and Combinatorics (to appear, 2007)"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"H\u00f6gberg, J., Maletti, A., May, J.: Bisimulation minimisation of weighted tree automata. Technical Report ISI-TR-634, U. So. California (2007)","DOI":"10.1007\/978-3-540-76336-9_12"},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing\u00a016, 973\u2013989 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/11812128_17","volume-title":"Implementation and Application of Automata","author":"P.A. Abdulla","year":"2006","unstructured":"Abdulla, P.A., Kaati, L., H\u00f6gberg, J.: Bisimulation minimization of tree automata. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 173\u2013185. Springer, Heidelberg (2006)"},{"key":"23_CR17","unstructured":"Borchardt, B.: The Theory of Recognizable Tree Series. Akademische Abhandlungen zur Informatik. Verlag f\u00fcr Wissenschaft und Forschung (2005)"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Kaati, L., H\u00f6gberg, J.: Bisimulation minimization of tree automata. Technical Report UMINF 06.25, Ume\u00e5 University (2006)","DOI":"10.1007\/11812128_17"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"532","DOI":"10.1109\/PROC.1976.10159","volume":"64","author":"F. Jelinek","year":"1976","unstructured":"Jelinek, F.: Continuous speech recognition by statistical methods. Proc. IEEE\u00a064, 532\u2013557 (1976)","journal-title":"Proc. IEEE"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Galley, M., Hopkins, M., Knight, K., Marcu, D.: What\u2019s in a translation rule? In: Proc. HLT-NAACL, pp. 273\u2013280 ( 2004)","DOI":"10.21236\/ADA460212"},{"key":"23_CR21","doi-asserted-by":"publisher","first-page":"523","DOI":"10.3115\/1073012.1073079","volume-title":"Proc. ACL","author":"K. Yamada","year":"2001","unstructured":"Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. ACL, pp. 523\u2013530. Morgan Kaufmann, San Francisco (2001)"},{"key":"23_CR22","first-page":"313","volume":"19","author":"M.P. Marcus","year":"1993","unstructured":"Marcus, M.P., Marcinkiewicz, M.A., Santorini, B.: Building a large annotated corpus of english: The Penn treebank. Comp. Linguistics\u00a019, 313\u2013330 (1993)","journal-title":"Comp. Linguistics"}],"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\/978-3-540-73208-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T21:34:02Z","timestamp":1558474442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73208-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540732075","9783540732082"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73208-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}