Unavoidable languages, cuts and innocent sets of words
RAIRO-Theor. Inf. Appl., 29 5 (1995) 339-382
Published online: 2017-02-01
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Unavoidable Sets of Partial Words of Uniform Length
Joey Becker, F. Blanchet-Sadri, Laure Flapan and Stephen WatkinsElectronic Proceedings in Theoretical Computer Science 252 26 (2017)
https://doi.org/10.4204/EPTCS.252.7
Number of holes in unavoidable sets of partial words I
F. Blanchet-Sadri, Bob Chen and Aleksandar ChakarovJournal of Discrete Algorithms 14 55 (2012)
https://doi.org/10.1016/j.jda.2011.12.001
Combinatorial Algorithms
Francine Blanchet-Sadri, Bob Chen and Aleksandar ChakarovLecture Notes in Computer Science, Combinatorial Algorithms 6460 43 (2011)
https://doi.org/10.1007/978-3-642-19222-7_6
THE LENGTH OF SHORT WORDS IN UNAVOIDABLE SETS
PETER M. HIGGINSInternational Journal of Algebra and Computation 21 (06) 951 (2011)
https://doi.org/10.1142/S0218196711006522
Testing avoidability on sets of partial words is hard
F. Blanchet-Sadri, Raphaël M. Jungers and Justin PalumboTheoretical Computer Science 410 (8-10) 968 (2009)
https://doi.org/10.1016/j.tcs.2008.11.011
Unavoidable Sets of Partial Words
F. Blanchet-Sadri, N. C. Brownstein, Andy Kalcic, Justin Palumbo and T. WeyandTheory of Computing Systems 45 (2) 381 (2009)
https://doi.org/10.1007/s00224-008-9106-1
Unavoidable Sets of Words of Uniform Length
C.J. Saker and P.M. HigginsInformation and Computation 173 (2) 222 (2002)
https://doi.org/10.1006/inco.2001.3123
Inventories of unavoidable languages and the word-extension conjecture
Laurent RosazTheoretical Computer Science 201 (1-2) 151 (1998)
https://doi.org/10.1016/S0304-3975(97)00031-5
Handbook of Formal Languages
Christian Choffrut and Juhani KarhumäkiHandbook of Formal Languages 329 (1997)
https://doi.org/10.1007/978-3-642-59136-5_6