Bisimulation minimization of tree automata

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

Volumn 4094 LNCS, Issue , 2006, Pages 173-185

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

^a UPPSALA UNIVERSITY   (Sweden)

^b UMEÅ UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING; TREES (MATHEMATICS);

BISIMULATION MINIMIZATION; NON-DETERMINISTIC TREE AUTOMATA (NTA); TRANSITION TABLE; TREE AUTOMATA;

FINITE AUTOMATA;

EID: 33749393950     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11812128_17     Document Type: Conference Paper

References (13)

1. P. A. Abdulla, A.Legay, J.d'Orso, and A.Rezine. Tree regular model checking: A simulation-based approach. To appear in Jour. of Logic and Alg. Programming, 2006.
2. P. A. Abdulla, B. Jonsson, P. Mahata, and J. d'Orso. Regular tree model checking. In CAV, volume 2404 of Lecture Notes in Computer Science, pages 555-568. Springer, 2002.
3. P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena. A survey of regular model checking. In CONCUR, volume 3170 of Lecture Notes in Computer Science, pages 35-48. Springer, 2004.
4. P. A. Abdulla, L. Kaati, and J. Högberg. Minimization of tree automata. UMINF 06.25, Department of Computer Science, Umeå University, 2006.
5. M. Biehl, N. Klarlund, and T. Rauhe. Algorithms for guided tree automata. In Proceedings of the First Workshop on Implementing Automata, volume 1260 of Lecture Notes in Computer Science. Springer, 1997.
6. W. S. Brainerd. The minimalization of tree automata. Information and Computation, 13:484-491, 1968.
7. J. Cristau, C. Löding, and W. Thomas. Deterministic automata on unranked trees. In FCT, volume 3623 of Lecture Notes in Computer Science. Springer, 2005.
8. G. Gramlich and G. Schnitger. Minimizing nfa's and regular expressions. In STAGS, volume 3404 of Lecture Notes in Computer Science. Springer, 2005.
9. J. E. Hopcroft. An n log n algorithm for minimizing states in a finite automaton. In Z. Kohavi, editor, Theory of Machines and Computations. Academic Press, 1971.
10. A. R. Meyer and L. J. Stockmeyer. The equivalence problem for regular expressions. In Proc. 13th Ann. IEEE Symp. on Switching and Automata Theory, pages 125-129, 1972.
11. M. Murata. "Hedge Automata: a Formal Model for XML Schemata". Web page, 2000.
12. M. Nivat and A. Podelski. Minimal ascending and descending tree automata. SIAM Journal on Computing, 26:39-58, 1997.
13. R. Paige and R. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing, 16:973-989, 1987.