Backward and forward bisimulation minimisation of tree automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4783 LNCS, Issue , 2007, Pages 109-121

  Högberg, Johanna ^a   Maletti, Andreas ^b   May, Jonathan ^c  

^a UMEÅ UNIVERSITY   (Sweden)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Bisimulation; Minimisation; Natural language processing; Tree automata

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION;

BISIMULATION; TREE AUTOMATA;

AUTOMATA THEORY;

EID: 38149012393     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76336-9_12     Document Type: Conference Paper

References (15)

1. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automation. In: Kohavi, Z. (ed.) Theory of Machines and Computations, Academic Press, London (1971)
2. 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-129. IEEE Computer Society Press, Los Alamitos (1972)
3. Gramlich, G., Schnitger, C.: Minimizing NFAs and regular expressions. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 399-411. Springer, Heidelberg (2005)
4. Abdulla, P.A., Högberg, J., Kaati, L.: Bisimulation minimization of tree automata. In: IJFCS (2007)
5. Abdulla, P.A., Jonsson, B., Mahata, P., d'Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 555-568. Springer, Heidelberg (2002)
6. Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1-24. Springer, Heidelberg (2005)
7. Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM Journal on Computing 16, 973-989 (1987)
8. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata: Techniques and applications (1997), Available on http://www.grappa.univ-lille3.fr/tata
9. Buchholz, P.: Bisimulation relations for weighted automata (unpublished, 2007)
10. Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)
11. Jelinek, F.: Continuous speech recognition by statistical methods. Proc. IEEE 64, 532-557 (1976)
12. Galley, M., Hopkins, M., Knight, K., Marcu, D.: What's in a translation rule? In: Proc. 2004 Human Language Technology Conf. of the North American Chapter of the Association for Computational Linguistics, pp. 273-280 (2004)
13. Yamada, K., Knight, K.: A syntax-based statistical translation model. In: Proc. 39th Meeting of the Association for Computational Linguistics, pp. 523-530. Morgan Kaufmann, San Francisco (2001)
14. Marcus, M.P., Marcinkiewicz, M.A., Santorini, B.: Building a large annotated corpus of english: The Penn treebank. Computational Linguistics 19, 313-330 (1993)
15. May, J., Knight, K.: Tiburon: A weighted tree automata toolkit. In: Ibarra, O.H., Yen, H.-C. (eds.) CIAA 2006. LNCS, vol. 4094, pp. 102-113. Springer, Heidelberg (2006)