Minimization algorithms for sequential transducers

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 177-201

  Mohri, Mehryar ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Finite automata; Finite state transducers; Rational power series; Semiring; Shortest paths algorithms

Indexed keywords

EID: 0000116303     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00115-7     Document Type: Article

References (36)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.
2. A.V. Aho, R. Sethi, J.D. Ullman, Compilers, Principles, Techniques and Tools, Addison-Wesley, Reading, MA, 1986.
3. R.K. Ahuja, K. Mehlhorn, J.B. Orlin, R. Tarjan, Faster algorithms for the shortest path problem, Technical Report 193, Operations Research Center, MIT, 1988.
4. R. Bellman, On a routing problem, Quart. Appl. Math. 16 (1958)
5. J. Berstel, Transductions and Context-Free Languages, Teubner Studienbucher, Stuttgart, 1979.
6. D. Breslauer, The suffix tree of a tree and minimizing sequential transducers, Lecture Notes in Computer Science, vol. 1075, Springer, Berlin, 1996.
7. C. Choffrut, Une caractérisation des fonctions séquentielles et des fonctions sous-séquentielles en tant que relations rationnelles, Theoret. Comput. Sci. 5 (1977).
8. C. Choffrut, Contributions à l'étude de quelques familles remarquables de fonctions rationnelles, Ph.D. thesis (thèse de doctorat d'Etat), Université Paris 7, LITP, Paris, France, 1978.
9. C. Choffrut, A generalization of Ginsburg and Rose's characterization of g-s-m mappings, Lecture Notes in Computer Science, vol. 71, Springer, Berlin, 1979.
10. T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1992.
11. K. Culik II, J. Kari, Digital images and formal languages, in: G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, vol. 3, Springer, New York, 1997.
12. E.W. Dijkstra, A note on two problems in connexion with graphs, Numer. Math. 1 (1959) 269-271.
13. S. Eilenberg, Automata, Languages, and Machines, vol. A, Academic Press, New York, 1974.
14. C.C. Elgot, J.E. Mezei, On relations defined by generalized finite automata, IBM J. Res. Develop. 9 (1965).
15. R.W. Floyd, Algorithm 97 (SHORTEST PATH), Comm. ACM 18 (1968).
16. L.R. Ford, D.R. Fulkerson, Flows in Network, Princeton University Press, Princeton, NJ, 1962.
17. M.L. Fredman, R.E. Tarjan, Fibonacci heaps and their uses in improved optimalization problems, J. ACM 34 1987.
18. C. Frougny, Synchronisation déterministe des automates à délai borné. Theoret. Comput. Sci. (1997), to appear.
19. D.C. Kozen, The Design and Analysis of Algorithms, Springer, Berlin, 1991.
20. M. Mohri, Minimization of sequential transducers, Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994.
21. M. Mohri, On some applications of finite-state automata theory to natural language processing, J. Natur. Language Eng. 2 (1996).
22. M. Mohri, On the use of sequential transducers in natural language processing, in: Finite-State Language Processing, MIT Press, Cambridge, MA, 1997.
23. M. Mohri, Finite-state transducers in language and speech processing, Comput. Linguistics 23 (2) (1997).
24. A. Nerode, W. Kohn, Models for hybrid systems: automata, topologies, controllability, observability, Cornell University, Technical Report 93-28, MIT Press, Cambridge, MA, 1993.
25. J. Oncina, P. García, E. Vidal, Learning subsequential transducers for pattern recognition and interpretation tasks, IEEE Trans. Pattern Anal. Machine Intell. 15, 1993, pp. 448-458.
26. D. Perrin, Finite automata, in: J. Van Leuwen (Ed.), Handbook of Theoretical Computer Science, vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 1-57.
27. D. Perrin, Les débuts de la théorie des automates, Technical Report LITP 93.04, Institut Blaise Pascal, Paris, France, 1993.
28. C. Reutenauer, Subsequential functions: characterizations, minimization, examples, in: Proc. Internat. Meeting of Young Computer Scientists, Lecture Notes in Computer Science, Springer, Berlin, 1993.
29. D. Revuz, Dictionnaires et lexiques, méthodes et algorithmes, Ph.D. thesis, Université Paris 7, Paris, France, 1991.
30. M.P. Schützenberger, Sur une variante des fonctions séquentielles, Theoret. Comput. Sci. 4 (1977) 45-51.
31. M.P. Schützenberger, Polynomial decomposition of rational function, in: Lecture Notes in Computer Science, vol. 386, Springer, Berlin, 1987.
32. M.P. Schützenberger, C. Reutenauer, Minimization of rational word functions, SIAM J. Comput. 20 (4) (1991) 669-685.
33. R.E. Tarjan, Depth first search and linear graph algorithms, SIAM J. Comput. 1 (2) (1972) 146-160.
34. R.E. Tarjan, Finding dominators in directed graphs, SIAM J. Comput. 3 (1974) 62-89.
35. S. Warshall, A theorem on boolean matrices, J. ACM 9 (1962) 11-12.
36. A. Weber, R. Klemm, Economy of description for single-valued transducers, Inform, and Comput. 118 (1995) 327-340.