Christian Choffrut, Karel Culik II. On Extendibility of Unavoidable Sets. In Max Fontet, Kurt Mehlhorn, editors, STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings. Volume 166 of Lecture Notes in Computer Science, pages 326-338, Springer, 1984.
@inproceedings{ChoffrutC84,
title = {On Extendibility of Unavoidable Sets},
author = {Christian Choffrut and Karel Culik II},
year = {1984},
researchr = {https://researchr.org/publication/ChoffrutC84},
cites = {0},
citedby = {0},
pages = {326-338},
booktitle = {STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings},
editor = {Max Fontet and Kurt Mehlhorn},
volume = {166},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-12920-0},
}