The suffix tree of a tree and minimizing sequential transducers

Theoretical Computer Science

Volumn 191, Issue 1-2, 1998, Pages 131-144

  Breslauer, Dany ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000061584     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00319-2     Document Type: Article

References (19)

1. A.V. Aho, J.E. Hopcroft and J.D. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
2. R.K. Ahuja, T.L. Magnanti and J.B. Orlin, Network Flows (Prentice-Hall, Englewood Cliffs, NJ, 1993).
3. R.K. Ahuja, K. Mehlhorn, J.B. Orlin and R.E. Tarjan, Faster algorithms for the shortest path problem, J. Assoc. Comput. Mach. 37 (1990) 213-223.
4. A. Amir, M. Farach, R.M. Idury, J.A. La Poutré and A.A. Schäffer, Improved dynamic dictionary-matching, in: Proc. 4th ACM-SIAM Symp. on Discrete Algorithms (1993) 392-401.
5. A. Apostolico, The myriad virtues of subword trees, in: A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words, NATO ASI Series F, Vol. 12 (Springer, Berlin, 1985) 85-96.
6. O. Berkman and U. Vishkin, Finding level-ancestors in trees, J. Comput. System Sci. 48 (1994) 214-230.
7. M.T. Chen and J. Seiferas, Efficient and elegant subword-tree construction, in: A. Apostolico and Z. Galil, eds., Combinatorial Algorithms on Words, NATO ASI Series F, Vol. 12 (Springer, Berlin, 1985) 97-107.
8. R. Dial, Algorithm 360: Shortest path forest with topological ordering, Comm. ACM 12 (1969) 632-633.
9. R. Grossi and G.F. Italiano, Suffix trees and their applications in string algorithms, Manuscript, 1995.
10. D. Harel and R.E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput. 13 (1984) 338-355.
11. M. Harrison, Introduction to Formal Language Theory (Addison-Wesley, Reading, MA, 1978).
12. J.E. Hopcroft, An n log n algorithm for minimizing states in a finite automaton, in: Z. Kohavi and A. Paz, eds., Theory of Machines and Computation (Academic Press, New York, 1971) 189-196.
13. S.R. Kosaraju, Fast pattern matching in trees, in: Proc. 30th IEEE Symp. on Foundations of Computer Science (1989) 178-183.
14. E.M. McCreight, A space economical suffix tree construction algorithm, J. Assoc. Comput. Mach. 23 (1976) 262-272.
15. M. Mohri, Minimization of sequential transducers, in: Proc. 5th Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 807 (Springer, Berlin, 1994) 151-163.
16. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput. 17 (1988) 1253-1262.
17. M. Thorup, An O(log log n) priority queue, Manuscript, 1995.
18. P. Weiner, Linear pattern matching algorithms, in: Proc. 14th Symp. on Switching and Automata Theory (1973) 1-11.
19. J. Westbrook, Fast incremental planarity testing, in: Proc. 19th Internat. Colloq. on Automata, Languages, and Programming, Lecture Notes in Computer Science, Vol. 623 (Springer, Berlin, 1992) 342-353.