Computing the prefix of an automaton
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 6, pp. 503-514. 
@article{ITA_2000__34_6_503_0,
     author = {B\'eal, Marie-Pierre and Carton, Olivier},
     title = {Computing the prefix of an automaton},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {503--514},
     publisher = {EDP-Sciences},
     volume = {34},
     number = {6},
     year = {2000},
     mrnumber = {1844715},
     zbl = {0974.68105},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_2000__34_6_503_0/}
}
TY  - JOUR
AU  - Béal, Marie-Pierre
AU  - Carton, Olivier
TI  - Computing the prefix of an automaton
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 2000
SP  - 503
EP  - 514
VL  - 34
IS  - 6
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_2000__34_6_503_0/
LA  - en
ID  - ITA_2000__34_6_503_0
ER  - 
%0 Journal Article
%A Béal, Marie-Pierre
%A Carton, Olivier
%T Computing the prefix of an automaton
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 2000
%P 503-514
%V 34
%N 6
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_2000__34_6_503_0/
%G en
%F ITA_2000__34_6_503_0
Béal, Marie-Pierre; Carton, Olivier. Computing the prefix of an automaton. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 34 (2000) no. 6, pp. 503-514. http://archive.numdam.org/item/ITA_2000__34_6_503_0/

[1] A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison Wesley (1974). | MR | Zbl

[2] M.-P. Béal, Codage Symbolique. Masson (1993).

[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] J. Berstel, Transductions and Context-Free Languages. B.G. Teubner (1979). | MR | Zbl

[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. | MR

[6] D. Breslauer, The suffix tree of a tree and minimizing sequential transducers. Theoret. Comput. Sci. 191 (1998) 131-144. | MR | Zbl

[7] C. Choffrut, Contribution à l'étude de quelques familles remarquables de fonctions rationnelles. Thèse d'État, Université Paris VII (1978).

[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. | MR | Zbl

[9] T. H. Cormen, C. E . Leiserson and R. L. Rivest, Introduction to Algorithms. MIT Press (1990). | MR | Zbl

[10] M. Crochemore, C. Hancart and T. Lecroq, Algorithmique du Texte. Vuibert (to appear).

[11] C. Prougny, Numeration Systems, in Algebraic Combinatorics on Words, edited by M. Lothaire. Cambridge (to appear).

[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. | MR

[13] M. Mohri, Minimization algorithms for sequential transducers. Theoret. Comput. Sci. 234 (2000) 177-201. | MR | Zbl

[14] E. Roche and Y. Schabes, Finite-State Language Processing. MIT Press, Cambridge (1997) Chapter 7.