Backward and forward bisimulation minimization of tree automata

Theoretical Computer Science

Volumn 410, Issue 37, 2009, Pages 3539-3552

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

^a UMEÅ UNIVERSITY   (Sweden)

^b INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

^c UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

Bisimulation; Minimization; Partition refinement; Tree automaton; Tree language

Indexed keywords

BISIMULATION; MINIMIZATION; PARTITION REFINEMENT; TREE AUTOMATON; TREE LANGUAGE;

ALGORITHMS; COMPUTATIONAL LINGUISTICS; FINITE AUTOMATA; HOLMIUM; NATURAL LANGUAGE PROCESSING SYSTEMS; OPTIMIZATION; TRANSLATION (LANGUAGES);

ROBOTS;

EID: 67651111929     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2009.03.022     Document Type: Article

References (23)

1. Hopcroft J.E. An n log n algorithm for minimizing states in a finite automaton. Theory of Machines and Computations (1971), Academic Press 189-196
2. Meyer A.R., and Stockmeyer L.J. The equivalence problem for regular expressions with squaring requires exponential space. Proc. 13th Annual Symp. Foundations of Computer Science (1972), IEEE Computer Society 125-129
3. Gramlich G., and Schnitger G. Minimizing nfas and regular expressions. Proc. 22nd Int. Symp. Theoretical Aspects of Computer Science. LNCS vol. 3404 (2005), Springer Verlag 399-411
4. Gramlich G., and Schnitger G. Minimizing nfa's and regular expressions. Journal of Computer and System Sciences 73 6 (2007) 908-923
5. Gruber H., and Holzer M. Inapproximability of nondeterministic state and transition complexity assuming P ≠ NP. Proc. 11th Int. Conf. Developments in Language Theory. LNCS vol. 4588 (2007), Springer Verlag 205-216
6. Abdulla P.A., Kaati L., and Högberg J. Bisimulation minimization of tree automata. Proc. 11th Int. Conf. Implementation and Application of Automata. LNCS vol. 4094 (2006), Springer Verlag 173-185
7. Abdulla P.A., Jonsson B., Mahata P., and d'Orso J. Regular tree model checking. Proc. 14th Int. Conf. Computer Aided Verification. LNCS vol. 2404 (2002), Springer Verlag 555-568
8. Knight K., and Graehl J. An overview of probabilistic tree transducers for natural language processing. Proc. 6th Int. Conf. Computational Linguistics and Intelligent Text Processing. LNCS vol. 3406 (2005), Springer Verlag 1-24
9. Paige R., and Tarjan R. Three partition refinement algorithms. SIAM Journal on Computing 16 6 (1987) 973-989
10. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, M. Tommasi, Tree automata: Techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997
11. Buchholz P. Bisimulation relations for weighted automata. Theoretical Computer Science 393 1-3 (2008) 109-123
12. Yu S. Regular languages. Word, Language, Grammar. Handbook of Formal Languages vol. 1 (1997), Springer Verlag 41-110 (Ch. 2)
13. Abdulla P.A., Bouajjani A., Holík L., Kaati L., and Vojnar T. Composed bisimulation for tree automata. Proc. 13th Int. Conf. Implementation and Applications of Automata. LNCS vol. 5148 (2008), Springer Verlag 212-222
14. Abdulla P.A., Högberg J., and Kaati L. Bisimulation minimization of tree automata. International Journal of Foundations of Computer Science 18 4 (2007) 699-713
15. Papadimitriou C.H. Computational Complexity (1994), Addison-Wesley
16. Gécseg F., and Steinby M. Tree Automata (1984), Akadémiai Kiadó
17. Gécseg F., and Steinby M. Tree languages. Handbook of Formal Languages vol. 3 (1997), Springer Verlag 1-68 (Ch. 1)
18. J. Högberg, A. Maletti, J. May, Backward and forward bisimulation minimisation of tree automata, Tech. Rep. ISI-TR-633, University of Southern California, 2007
19. Jelinek F. Continuous speech recognition by statistical methods. Proceedings of the IEEE 64 4 (1976) 532-557
20. M. Galley, M. Hopkins, K. Knight, D. Marcu, What's in a translation rule? in: Proc. 2004 Human Language Technology Conf. of the North American Chapter of the Association for Computational Linguistics, 2004, pp. 273-280
21. Yamada K., and Knight K. A syntax-based statistical translation model. Proc. 39th Meeting of the Association for Computational Linguistics (2001), Morgan Kaufmann 523-530
22. Marcus M.P., Marcinkiewicz M.A., and Santorini B. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics 19 2 (1993) 313-330
23. May J., and Knight K. Tiburon: A weighted tree automata toolkit. Proc. 11th Int. Conf. Implementation and Application of Automata. LNCS vol. 4094 (2006), Springer Verlag 102-113