Freeness of partial words. - Florin Manea; Robert Mercas (Theor. Comput. Sci., 2007)

Networks of Evolutionary Processors as Natural Parsers. - Gemma Bel Enguix; María Dolores Jiménez-López; Robert Mercas; Alexander Perekrestenko (ICAART, 2009)

PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing. - Alfonso Ortega 002; Emilio del Rosal García; Diana Pérez 001; Robert Mercas; Alexander Perekrestenko; Manuel Alfonseca 001 (IWANN (1), 2009)

How Many Holes Can an Unbordered Partial Word Contain?. - Francine Blanchet-Sadri; Emily Allen; Cameron Byrum; Robert Mercas (LATA, 2009)

An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms. - Francine Blanchet-Sadri; Robert Mercas; Abraham Rashin; Elara Willett (LATA, 2009)

Counting Distinct Squares in Partial Words. - Francine Blanchet-Sadri; Robert Mercas; Geoffrey Scott (Acta Cybern., 2009)

Unbordered partial words. - Francine Blanchet-Sadri; C. D. Davis; Joel Dodge; Robert Mercas; Margaret Moorefield (Discret. Appl. Math., 2009)

A note on the number of squares in a partial word with one hole. - Francine Blanchet-Sadri; Robert Mercas (RAIRO Theor. Informatics Appl., 2009)

A generalization of Thue freeness for partial words. - Francine Blanchet-Sadri; Robert Mercas; Geoffrey Scott (Theor. Comput. Sci., 2009)

Abelian Square-Free Partial Words. - Francine Blanchet-Sadri; Jane I. Kim; Robert Mercas; William Severa; Sean Simmons 001 (LATA, 2010)

Contextual partial commutations. - Christian Choffrut; Robert George Mercas (Discret. Math. Theor. Comput. Sci., 2010)

Repetitions in partial words. - Robert Mercas (2010)

Periodicity Algorithms for Partial Words. - Florin Manea; Robert Mercas; Catalin Tiseanu (MFCS, 2011)

Avoidable binary patterns in partial words. - Francine Blanchet-Sadri; Robert Mercas; Sean Simmons 001; Eric Weissenstein (Acta Informatica, 2011)

Counting Bordered Partial Words by Critical Positions. - Emily Allen; Francine Blanchet-Sadri; Cameron Byrum; Mihai Cucuringu; Robert Mercas (Electron. J. Comb., 2011)

Avoiding large squares in partial words. - Francine Blanchet-Sadri; Ilkyoo Choi; Robert Mercas (Theor. Comput. Sci., 2011)

Hairpin Lengthening and Shortening of Regular Languages. - Florin Manea; Robert Mercas; Victor Mitrana (Languages Alive, 2012)

Connecting Partial Words and Regular Languages. - Jürgen Dassow; Florin Manea; Robert Mercas (CiE, 2012)

Hairpin Completion with Bounded Stem-Loop. - Szilárd Zsolt Fazekas; Robert Mercas; Kayoko Shikishima-Tsuji (Developments in Language Theory, 2012)

Fine and Wilf's Theorem and Pseudo-repetitions. - Florin Manea; Robert Mercas; Dirk Nowotka (MFCS, 2012)

Erratum to: Avoidable binary patterns in partial words. - Francine Blanchet-Sadri; Robert Mercas; Sean Simmons 001; Eric Weissenstein (Acta Informatica, 2012)

Avoiding abelian squares in partial words. - Francine Blanchet-Sadri; Jane I. Kim; Robert Mercas; William Severa; Sean Simmons 001; Dimin Xu (J. Comb. Theory A, 2012)

The three-squares lemma for partial words with one hole. - Francine Blanchet-Sadri; Robert Mercas (Theor. Comput. Sci., 2012)

Periodicity algorithms and a conjecture on overlaps in partial words. - Francine Blanchet-Sadri; Robert Mercas; Abraham Rashin; Elara Willett (Theor. Comput. Sci., 2012)

The Lexicographic Cross-Section of the Plactic Monoid Is Regular. - Christian Choffrut; Robert Mercas (WORDS, 2013)

3-Abelian Cubes Are Avoidable on Binary Alphabets. - Robert Mercas; Aleksi Saarela (Developments in Language Theory, 2013)

Finding Pseudo-repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka; Catalin Tiseanu (STACS, 2013)

A Note on the Decidability of subword inequalities. - Szilárd Zsolt Fazekas; Robert Mercas (Int. J. Found. Comput. Sci., 2013)

Fewer runs than word length. - Maxime Crochemore; Robert Mercas (CoRR, 2014)

An algorithmic toolbox for periodic partial words. - Florin Manea; Robert Mercas; Catalin Tiseanu (Discret. Appl. Math., 2014)

The pseudopalindromic completion of regular languages. - Szilárd Zsolt Fazekas; Florin Manea; Robert Mercas; Kayoko Shikishima-Tsuji (Inf. Comput., 2014)

Inner Palindromic Closure. - Jürgen Dassow; Florin Manea; Robert Mercas; Mike Müller (Int. J. Found. Comput. Sci., 2014)

Regular languages of partial words. - Jürgen Dassow; Florin Manea; Robert Mercas (Inf. Sci., 2014)

Binary patterns in binary cube-free words: Avoidability and growth. - Robert Mercas; Pascal Ochem; Alexey V. Samsonov; Arseny M. Shur (RAIRO Theor. Informatics Appl., 2014)

5-Abelian cubes are avoidable on binary alphabets. - Robert Mercas; Aleksi Saarela (RAIRO Theor. Informatics Appl., 2014)

Pattern Matching with Variables: Fast Algorithms and New Hardness Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (STACS, 2015)

Circular Sequence Comparison with q-grams. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (WABI, 2015)

A note on the avoidability of binary patterns with variables and reversals. - Robert Mercas (CoRR, 2015)

k-Abelian pattern matching. - Thorsten Ehlers; Florin Manea; Robert Mercas; Dirk Nowotka (J. Discrete Algorithms, 2015)

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications. - Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (LATIN, 2016)

Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

Erratum to: Circular sequence comparison: algorithms and applications. - Roberto Grossi; Costas S. Iliopoulos; Robert Mercas; Nadia Pisanti; Solon P. Pissis; Ahmad Retha; Fatima Vayani (Algorithms Mol. Biol., 2016)

On the density of Lyndon roots in factors. - Maxime Crochemore; Robert Mercas (Theor. Comput. Sci., 2016)

A note on Thue games. - Robert Mercas; Dirk Nowotka (Inf. Process. Lett., 2017)

Preface. - Robert Mercas; Nadia Pisanti (J. Discrete Algorithms, 2017)

Counting maximal-exponent factors in words. - Golnaz Badkobeh; Maxime Crochemore; Robert Mercas (Theor. Comput. Sci., 2017)

On the aperiodic avoidability of binary patterns with variables and reversals. - Robert Mercas (Theor. Comput. Sci., 2017)

Alignment-free sequence comparison using absent words. - Panagiotis Charalampopoulos; Maxime Crochemore; Gabriele Fici; Robert Mercas; Solon P. Pissis (Inf. Comput., 2018)

Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77]. - Karol Kosinski; Robert Mercas; Dirk Nowotka (Inf. Process. Lett., 2018)

Revisiting Shinohara's algorithm for computing descriptive patterns. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (Theor. Comput. Sci., 2018)

Hide and seek with repetitions. - Pawel Gawrychowski; Florin Manea; Robert Mercas; Dirk Nowotka (J. Comput. Syst. Sci., 2019)

On the Prefix-Suffix Duplication Reduction. - Szilárd Zsolt Fazekas; Robert Mercas; Daniel Reidenbach (Int. J. Found. Comput. Sci., 2020)

Pattern Matching with Variables: Efficient Algorithms and Complexity Results. - Henning Fernau; Florin Manea; Robert Mercas; Markus L. Schmid (ACM Trans. Comput. Theory, 2020)

Clusters of Repetition Roots: Single Chains. - Szilárd Zsolt Fazekas; Robert Mercas (SOFSEM, 2021)

Reducing the ambiguity of Parikh matrices. - Jeffery Dick; Laura K. Hutchinson; Robert Mercas; Daniel Reidenbach (Theor. Comput. Sci., 2021)

Clusters of Repetition Roots Forming Prefix Chains. - Szilárd Zsolt Fazekas; Robert Mercas (DCFS, 2022)

A Toolkit for Parikh Matrices. - Laura K. Hutchinson; Robert Mercas; Daniel Reidenbach (CIAA, 2022)

Complexities for Jumps and Sweeps. - Szilárd Zsolt Fazekas; Robert Mercas; Olívia Wu (J. Autom. Lang. Comb., 2022)

Sweep Complexity Revisited. - Szilárd Zsolt Fazekas; Robert Mercas (CIAA, 2023)

Subsequence Matching and Analysis Problems for Formal Languages. - Szilárd Zsolt Fazekas; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (ISAAC, 2024)

Subsequence Matching and Analysis Problems for Automata with Translucent Letters. - Szilárd Zsolt Fazekas; Béla Klein; Tore Koß; Florin Manea; Robert Mercas; Timo Specht (CIAA, 2025)

Ternary is still good for Parikh matrices. - Robert Mercas; Wen Chean Teh (Theor. Comput. Sci., 2025)