Unavoidable set : extension and reduction
Phan Trung Huy ; Nguyen Huong Lam
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999), p. 213-225 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1999-01-01
@article{ITA_1999__33_3_213_0,
     author = {Phan Trung Huy and Nguyen Huong Lam},
     title = {Unavoidable set : extension and reduction},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {33},
     year = {1999},
     pages = {213-225},
     mrnumber = {1728424},
     zbl = {0941.68104},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1999__33_3_213_0}
}

Phan Trung Huy; Nguyen Huong Lam. Unavoidable set : extension and reduction. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) pp. 213-225. http://gdmltest.u-ga.fr/item/ITA_1999__33_3_213_0/

[1] M.-P. Schützenberger, On the Synchronizing Properties of Certain Prefix Codes. Inform. and Control 7 (1964) 23-36. | MR 199049 | Zbl 0122.15004

[2] A. V. Aho and M. J. Corasick, Efficient String Machines, an Aid to Bibliographic Research. Comm. ACM 18 (1975) 333-340. | MR 371172 | Zbl 0301.68048

[3] A. Ehrenfeucht, D. Haussler and G. Rozengerg, On Regularity of Context-free Languages. Theoret Comput. Sci. 27 (1983) 311-332. | MR 731068 | Zbl 0553.68044

[4] Ch. Choffrut and K. Culik Ii, On Extendibility of Unavoidable Sets. Discrete Appl. Math. 9 (1984) 125-137. | MR 761597 | Zbl 0629.68080

[5] L. Rosaz, Inventories of Unavoidable Languages and the Word-Extension Conjecture, to appear. | MR 1625403 | Zbl 0902.68099