- Articles in journals
- (2011) F. Blanchet-Sadri and R. Mercas: Three-squares lemma for partial words with one hole. Theoretical Computer Science, to appear. [pdf]
- (2011) F. Blanchet-Sadri, I. Choi and R. Mercas: Avoiding large squares in partial words. Theoretical Computer Science, to appear. [pdf]
- (2011) F. Blanchet-Sadri, R. Mercas, S. Simmons and E. Weissenstein: Avoidable binary patterns on partial words. Acta Informatica, Vol. 48, Issue 1, February 2011, pp 25-41. [pdf]
- (2010) C. Choffrut and R. Mercas: Contextual partial commutations. Discrete Mathematics & Theoretical Computer Science Vol. 12, Issue 4, 4 October 2010, pp 59-72. [pdf]
- (2009) F. Blanchet-Sadri, R. Mercas and G. Scott: Counting distinct squares in partial words. Acta Cybernetica, Vol. 19, Issues 2, December 2009, pp 465-477. [pdf]
- (2009) F. Blanchet-Sadri and R. Mercas: A note on the number of squares in partial words with one hole. RAIRO - Theoretical Informatics and Applications, Vol. 43, November 2009, pp 767-774. [pdf]
- (2009) F. Blanchet-Sadri, R. Mercas and G. Scott: A generalization of Thue freeness for partial words. Theoretetical Computer Science, Vol. 410, Issues 8-10, 1 March 2009, pp 793-800. [pdf]
- (2008) F. Blanchet-Sadri, C.D. Davis, J. Dodge, R. Mercas, M. Moorefield: Unbordered Partial Words. Discrete Applied Mathematics, Vol. 157, Issue 5, March 2009, pp. 890-900. [pdf]
- (2007) F. Manea, R. Mercas: Freeness of partial words. Theoretical Computer Science, Vol. 389, pp 265-277. [pdf]
- Contributions to refereed conference proceedings
- (2010) F. Blanchet-Sadri, J. Kim, R. Mercas, W. Severa and S. Simmons: Abelian square-free partial words. In: A.H. Dediu, H. Fernau, and C. Martín-Vide (Eds.): LATA 2010, LNCS 6031, Springer-Verlag, pp. 94-105. [pdf]
- (2010) F. Blanchet-Sadri, R. Mercas, S. Simmons and E. Weissenstein: Avoidable binary patterns on partial words. In: A.H. Dediu, H. Fernau, and C. Martín-Vide (Eds.): LATA 2010, LNCS 6031, Springer-Verlag, pp. 106-117. [pdf]
- (2009) F. Blanchet-Sadri, R. Mercas and K. Wetzler: The three-squares lemma for partial words with one hole. 7th International Conference on Words.[pdf]
- (2009) C. Choffrut and R. Mercas: Contextual partial commutations. Automata: from Mathematics to Applications (AutoMathA 2009, Liège, Belgium).
- (2009) A. Ortega, E. del Rosal García, D. Pérez, R. Mercas, A. Perekrestenko and M. Alfonseca: PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. In: J. Cabestany, F. Sandoval, A. Prieto and J. M. Corchado (Eds.): 10th International Work-Conference on Artificial Neural Networks, IWANN 2009, LNCS 5517. Springer Berlin - Heidelberg, pp. 472-479.
- (2009) F. Blanchet-Sadri, E. Allen, C. Byrum and R. Mercas: How many holes can an unbordered partial word contain. In: A.H. Dediu, A.M. Ionescu, and C. Martín-Vide (Eds.): LATA 2009, LNCS 5457. Springer-Verlag, pp. 176–187. [pdf]
- (2009) F. Blanchet-Sadri, R. Mercas, A. Rashin and E. Willett: An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. In: A.H. Dediu, A.M. Ionescu, and C. Martín-Vide (Eds.): LATA 2009, LNCS 5457. Springer-Verlag, pp. 188-199. [pdf]
- (2009) G. Bel-Enguix , M.D. Jimenez-Lopez, R. Mercas and A. Perekrestenko: Networks of Evolutionary Processors as Natural Language Parsers. In: Joaquim Filipe, Ana Fred and Bernadette Sharp (Eds.), Proceedings of the 1st International Conference on Agents and Artificial Intelligence (ICAART 2009, Porto, Portugal). ISBN 978-989- 8111-73-9, pp. 626-631.[pdf]
- (2008) F. Blanchet-Sadri, R. Mercas and G. Scott: Counting Distinct Squares in Partial Words. In E. Csuhaj-Varju and Z. Esik (Eds.), AFL 2008, 12th International Conference on Automata and Formal Languages, Balatonfüred, Hungary, Proceedings, pp 122-133. [pdf]
Here you can find my DBLP list of publications.
Disclaimer: Please note that these are preliminary versions of the papers, that might contain small errors and typos.