Unavoidable set : extension and reduction
RAIRO. Theoretical Informatics and Applications, Tome 33 (1999) no. 3, pp. 213-225
@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},
pages = {213--225},
year = {1999},
publisher = {EDP-Sciences},
volume = {33},
number = {3},
mrnumber = {1728424},
zbl = {0941.68104},
language = {en},
url = {https://www.numdam.org/item/ITA_1999__33_3_213_0/}
}
TY - JOUR AU - Phan Trung Huy AU - Nguyen Huong Lam TI - Unavoidable set : extension and reduction JO - RAIRO. Theoretical Informatics and Applications PY - 1999 SP - 213 EP - 225 VL - 33 IS - 3 PB - EDP-Sciences UR - https://www.numdam.org/item/ITA_1999__33_3_213_0/ LA - en ID - ITA_1999__33_3_213_0 ER -
Phan Trung Huy; Nguyen Huong Lam. Unavoidable set : extension and reduction. RAIRO. Theoretical Informatics and Applications, Tome 33 (1999) no. 3, pp. 213-225. https://www.numdam.org/item/ITA_1999__33_3_213_0/
[1] , On the Synchronizing Properties of Certain Prefix Codes. Inform. and Control 7 (1964) 23-36. | Zbl | MR
[2] and , Efficient String Machines, an Aid to Bibliographic Research. Comm. ACM 18 (1975) 333-340. | Zbl | MR
[3] , and , On Regularity of Context-free Languages. Theoret Comput. Sci. 27 (1983) 311-332. | Zbl | MR
[4] and , On Extendibility of Unavoidable Sets. Discrete Appl. Math. 9 (1984) 125-137. | Zbl | MR
[5] , Inventories of Unavoidable Languages and the Word-Extension Conjecture, to appear. | Zbl | MR





