{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:13:13Z","timestamp":1759032793971},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540763352"},{"type":"electronic","value":"9783540763369"}],"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-76336-9_12","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T01:44:48Z","timestamp":1193449488000},"page":"109-121","source":"Crossref","is-referenced-by-count":8,"title":["Backward and Forward Bisimulation Minimisation of 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":"12_CR1","volume-title":"Theory of Machines and Computations","author":"J.E. Hopcroft","year":"1971","unstructured":"Hopcroft, J.E.: An \n                    \n                      \n                    \n                    $n\\,\\textrm{log}\\, n$\n                   algorithm for minimizing states in a finite automation. In: Kohavi, Z. (ed.) Theory of Machines and Computations, Academic Press, London (1971)"},{"key":"12_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 Press, Los Alamitos (1972)"},{"key":"12_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":"12_CR4","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., H\u00f6gberg, J., Kaati, L.: Bisimulation minimization of tree automata. In: IJFCS (2007)","DOI":"10.1007\/11812128_17"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-45657-0_47","volume-title":"Computer Aided Verification","author":"P.A. Abdulla","year":"2002","unstructured":"Abdulla, P.A., Jonsson, B., Mahata, P., d\u2019Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 555\u2013568. Springer, Heidelberg (2002)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"K. Knight","year":"2005","unstructured":"Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol.\u00a03406, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"12_CR7","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":"12_CR8","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata: Techniques and applications (1997), available on \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"12_CR9","unstructured":"Buchholz, P.: Bisimulation relations for weighted automata (unpublished, 2007)"},{"key":"12_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"12_CR11","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":"12_CR12","doi-asserted-by":"crossref","unstructured":"Galley, M., Hopkins, M., Knight, K., Marcu, D.: What\u2019s in a translation rule? In: Proc. 2004 Human Language Technology Conf. of the North American Chapter of the Association for Computational Linguistics, pp. 273\u2013280 (2004)","DOI":"10.21236\/ADA460212"},{"key":"12_CR13","first-page":"523","volume-title":"Proc. 39th Meeting of the Association for Computational Linguistics","author":"K. Yamada","year":"2001","unstructured":"Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. 39th Meeting of the Association for Computational Linguistics, pp. 523\u2013530. Morgan Kaufmann, San Francisco (2001)"},{"key":"12_CR14","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. Computational Linguistics\u00a019, 313\u2013330 (1993)","journal-title":"Computational Linguistics"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/11812128_11","volume-title":"Implementation and Application of Automata","author":"J. May","year":"2006","unstructured":"May, J., Knight, K.: Tiburon: A weighted tree automata toolkit. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol.\u00a04094, pp. 102\u2013113. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76336-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:39:58Z","timestamp":1558262398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76336-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540763352","9783540763369"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76336-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}