Loughborough University
Browse

Robert Mercas

Publications

  • Circular sequence comparison: algorithms and applications
  • The three-squares lemma for partial words with one hole
  • How Many Holes Can an Unbordered Partial Word Contain?
  • PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing
  • Unbordered partial words
  • BINARY PATTERNS IN BINARY CUBE-FREE WORDS: AVOIDABILITY AND GROWTH
  • The pseudopalindromic completion of regular languages
  • Circular Sequence Comparison with q-grams
  • k-Abelian pattern matching
  • A NOTE ON THE DECIDABILITY OF SUBWORD INEQU ALITIES
  • Abelian Square-Free Partial Words
  • Freeness of partial words
  • Avoidable binary patterns in partial words
  • Avoiding large squares in partial words
  • 5-ABELIAN CUBES ARE AVOIDABLE ON BINARY ALPHABETS
  • An algorithmic toolbox for periodic partial words
  • INNER PALINDROMIC CLOSURE
  • Regular languages of partial words
  • Avoidable binary patterns in partial words (vol 48, pg 25, 2011)
  • Avoiding abelian squares in partial words
  • Fine and Wilf's Theorem and Pseudo-repetitions
  • Periodicity algorithms and a conjecture on overlaps in partial words
  • Periodicity Algorithms for Partial Words
  • Avoidable Binary Patterns in Partial Words
  • Contextual partial commutations
  • A generalization of Thue freeness for partial words
  • A NOTE ON THE NUMBER OF SQUARES IN A PARTIAL WORD WITH ONE HOLE
  • An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms

Usage metrics

Co-workers & collaborators

Jeff Dick

Jeff Dick

Robert Mercas's public data