Computing the prefix of an automaton

 Access to full text

 Full (PDF)

1. [1] A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison Wesley (1974). Zbl0326.68005MR413592
2. [2] M.-P. Béal, Codage Symbolique. Masson (1993). 
3. [3] M.-P. Béal and O. Carton, Determinization of transducers over finita and infinite words. Tech. Rep. 99-12, I.G.M., Université de Marne-la-Vallée (1999). 
4. [4] J. Berstel, Transductions and Context-Free Languages. B.G. Teubner (1979). Zbl0424.68040MR549481
5. [5] D. Breslauer, The suffix tree of a tree and minimizing sequential transducers, in CPM'96. Springer-Verlag, Lecture Notes in Comput. Sci. 1075 (1996) 116-129. MR1436878
6. [6] D. Breslauer, The suffix tree of a tree and minimizing sequential transducers. Theoret. Comput. Sci. 191 (1998) 131-144. Zbl0896.68058MR1490567
7. [7] C. Choffrut, Contribution à l'étude de quelques familles remarquables de fonctions rationnelles. Thèse d'État, Université Paris VII (1978). 
8. [8] C. Choffrut, A generalization of Ginsburg and Rose's characterization of gsm mappings, in ICALP'79. Springer-Verlag, Lecture Notes in Comput. Sci. 71 (1979) 88-103. Zbl0419.68086MR573236
9. [9] T. H. Cormen, C. E . Leiserson and R. L. Rivest, Introduction to Algorithms. MIT Press (1990). Zbl1158.68538MR1066870
10. [10] M. Crochemore, C. Hancart and T. Lecroq, Algorithmique du Texte. Vuibert (to appear). 
11. [11] C. Prougny, Numeration Systems, in Algebraic Combinatorics on Words, edited by M. Lothaire. Cambridge (to appear). 
12. [12] M. Mohri, Minimization of sequential transducers, in CPM'94, edited by M. Crochemore and D. Gusfield. Springer-Verlag, Lecture Notes in Comput. Sci. 807 (1994) 151-163. MR1289209
13. [13] M. Mohri, Minimization algorithms for sequential transducers. Theoret. Comput. Sci. 234 (2000) 177-201. Zbl0944.68091MR1745074
14. [14] E. Roche and Y. Schabes, Finite-State Language Processing. MIT Press, Cambridge (1997) Chapter 7.