Bisimulation minimization of tree automata

International Journal of Foundations of Computer Science

Volumn 18, Issue 4, 2007, Pages 699-713

  Abdulla, Parosh Aziz ^a   Högberg, Johanna ^b   Kaati, Lisa ^a  

^a UPPSALA UNIVERSITY   (Sweden)

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

Bisimulation; Minimization; Tree automata

Indexed keywords

EID: 34547599691     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054107004929     Document Type: Article

References (18)

1. P.A. Abdulla and J. Högberg and L.Kaati, "Bisimulation Minimization Of Tree Automata" Technical report, Uppsala University, 2006.
2. P.A. Abdulla and B. Jonsson and P.Mahata and J. d'Orso, "Regular Tree Model Checking", in CAV, LNCS 2404, 555-568, 2002.
3. P. A. Abdulla and B.Jonsson and M.Nilsson and M.Saksena, "A Survey of Regular Model Checking", in CONCUR, LNCS 3170, 35-48, 2004.
4. P.A. Abdulla and A.Legay and J.d'Orso and A.Rezine, "Tree Regular Model Checking: A Simulation-Based Approach", Journal of Logic and Algebraic Programming, 69(1-2):93-121, 2006.
5. M.Biehl and N.Klarlund and T.Rauhe, "Algorithms for guided tree automata", in Proceedings of the First Workshop on Implementing Automata, LNCS 1260, 1997.
6. W. S. Brainerd, "The Minimalization of Tree Automata", in Information and Computation13(5):484-491, 1968.
7. H. Comon and M. Dauchet and R. Gilleron and F. Jacquemard and D. Lugiez and S. Tison and M. Tommasi, "Tree Automata Techniques and Applications", Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
8. J. Carme and R. Gilleron and A. Lemay and A. Terlutte and M. Tommasi, "Residual finite tree automata", Technical report, GRAPPA, 2003.
9. J. Cristau and C. Löding and W.Thomas, "Deterministic automata on unranked trees", in FCT, LNCS 3623, 68-79, 2005.
10. G. Gramlich and G. Schnitger, "Minimizing NFA's and Regular Expressions", in STACS, LNCS 3404, 399-411, 2005.
11. J. E. Hopcroft, "An n log nalgorithm for minimizing states in a finite automaton", in Theory of Machines and Computations, 189-196, 1971.
12. Y. Kesten and O. Maler and M. Marcus and A. Pnueli and E. Shahar, "Symbolic Model Checking with Rich Assertional Languages", in TCS256 (1-2): 93-112, 2001.
13. R. Milner, "A Calculus of Communicating Systems", in LNCS 92, 1980.
14. W. Martens and J. Niehren, "On the Minimization of XML Schemas and Tree Automata for Unranked Trees", in JCSS, 2006.
15. A. R. Meyer and L. J. Stockmeyer, "The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space", in Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory, 125-129, 1972.
16. F. Neven, "Automata, Logic, and XML", in CSL, 2-26, 2002.
17. M. Nivat and A. Podelski, "Minimal Ascending and Descending Tree Automata", in SIAM Journal on Computing26:39-58, 1997.
18. R. Paige and R. Tarjan, "Three partition refinement algorithms", in SIAM Journal on Computing16:973-989, 1987.