Robert Mercas

Proceedings of the Implementation and Application of Automata, 2023

2022

Complexities for Jumps and Sweeps.

[BibT_eX]

[DOI]

Olívia Wu

J. Autom. Lang. Comb., 2022

A Toolkit for Parikh Matrices.

[BibT_eX]

[DOI]

Laura K. Hutchinson

Daniel Reidenbach

Proceedings of the Implementation and Application of Automata, 2022

Clusters of Repetition Roots Forming Prefix Chains.

[BibT_eX]

[DOI]

Proceedings of the Descriptional Complexity of Formal Systems, 2022

2021

Reducing the ambiguity of Parikh matrices.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Clusters of Repetition Roots: Single Chains.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

2020

Pattern Matching with Variables: Efficient Algorithms and Complexity Results.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2020

On the Prefix-Suffix Duplication Reduction.

[BibT_eX]

[DOI]

Daniel Reidenbach

Int. J. Found. Comput. Sci., 2020

2019

Hide and seek with repetitions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2019

2018

Revisiting Shinohara's algorithm for computing descriptive patterns.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

Corrigendum to "A note on Thue games" [Inf. Process. Lett. 118 (2017) 75-77].

[BibT_eX]

[DOI]

Karol Kosinski

Panagiotis Charalampopoulos

Dirk Nowotka

Inf. Process. Lett., 2018

Alignment-free sequence comparison using absent words.

[BibT_eX]

[DOI]

Inf. Comput., 2018

2017

On the aperiodic avoidability of binary patterns with variables and reversals.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

Counting maximal-exponent factors in words.

[BibT_eX]

[DOI]

Golnaz Badkobeh

Maxime Crochemore

Theor. Comput. Sci., 2017

Preface.

[BibT_eX]

[DOI]

Nadia Pisanti

J. Discrete Algorithms, 2017

A note on Thue games.

[BibT_eX]

[DOI]

Dirk Nowotka

Inf. Process. Lett., 2017

2016

On the density of Lyndon roots in factors.

[BibT_eX]

[DOI]

Maxime Crochemore

Theor. Comput. Sci., 2016

Erratum to: Circular sequence comparison: algorithms and applications.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2016

Circular sequence comparison: algorithms and applications.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2016

Linear-Time Sequence Comparison Using Minimal Absent Words & Applications.

[BibT_eX]

[DOI]

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015

k-Abelian pattern matching.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2015

A note on the avoidability of binary patterns with variables and reversals.

[BibT_eX]

[DOI]

CoRR, 2015

Circular Sequence Comparison with q-grams.

[BibT_eX]

[DOI]

Proceedings of the Algorithms in Bioinformatics - 15th International Workshop, 2015

Pattern Matching with Variables: Fast Algorithms and New Hardness Results.

[BibT_eX]

[DOI]

Proceedings of the 32nd International Symposium on Theoretical Aspects of Computer Science, 2015

2014

5-Abelian cubes are avoidable on binary alphabets.

[BibT_eX]

[DOI]

Aleksi Saarela

RAIRO Theor. Informatics Appl., 2014

Binary patterns in binary cube-free words: Avoidability and growth.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Regular languages of partial words.

[BibT_eX]

[DOI]

Jürgen Dassow

Inf. Sci., 2014

Inner Palindromic Closure.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2014

The pseudopalindromic completion of regular languages.

[BibT_eX]

[DOI]

Kayoko Shikishima-Tsuji

Inf. Comput., 2014

An algorithmic toolbox for periodic partial words.

[BibT_eX]

[DOI]

Catalin Tiseanu

Discret. Appl. Math., 2014

Fewer runs than word length.

[BibT_eX]

[DOI]

Maxime Crochemore

CoRR, 2014

2013

A Note on the Decidability of subword inequalities.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2013

Finding Pseudo-repetitions.

[BibT_eX]

[DOI]

Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

3-Abelian Cubes Are Avoidable on Binary Alphabets.

[BibT_eX]

[DOI]

Aleksi Saarela

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

The Lexicographic Cross-Section of the Plactic Monoid Is Regular.

[BibT_eX]

[DOI]

Christian Choffrut

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

Periodicity algorithms and a conjecture on overlaps in partial words.

[BibT_eX]

[DOI]

Abraham Rashin

Elara Willett

Theor. Comput. Sci., 2012

The three-squares lemma for partial words with one hole.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Avoiding abelian squares in partial words.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2012

Erratum to: Avoidable binary patterns in partial words.

[BibT_eX]

[DOI]

Sean Simmons

Eric Weissenstein

Acta Informatica, 2012

Fine and Wilf's Theorem and Pseudo-repetitions.

[BibT_eX]

[DOI]

Dirk Nowotka

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Hairpin Completion with Bounded Stem-Loop.

[BibT_eX]

[DOI]

Kayoko Shikishima-Tsuji

Proceedings of the Developments in Language Theory - 16th International Conference, 2012

Connecting Partial Words and Regular Languages.

[BibT_eX]

[DOI]

Jürgen Dassow

Proceedings of the How the World Computes, 2012

Hairpin Lengthening and Shortening of Regular Languages.

[BibT_eX]

[DOI]

Victor Mitrana

Proceedings of the Languages Alive, 2012

2011

Avoiding large squares in partial words.

[BibT_eX]

[DOI]

Ilkyoo Choi

Theor. Comput. Sci., 2011

Counting Bordered Partial Words by Critical Positions.

[BibT_eX]

[DOI]

Emily Allen

Cameron Byrum

Mihai Cucuringu

Electron. J. Comb., 2011

Avoidable binary patterns in partial words.

[BibT_eX]

[DOI]

Sean Simmons

Eric Weissenstein

Acta Informatica, 2011

Periodicity Algorithms for Partial Words.

[BibT_eX]

[DOI]

Catalin Tiseanu

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

Repetitions in partial words.

[BibT_eX]

[DOI]

PhD thesis, 2010

Contextual partial commutations.

[BibT_eX]

[DOI]

Christian Choffrut

Robert George Mercas

Discret. Math. Theor. Comput. Sci., 2010

Abelian Square-Free Partial Words.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

2009

A generalization of Thue freeness for partial words.

[BibT_eX]

[DOI]

Geoffrey Scott

Theor. Comput. Sci., 2009

A note on the number of squares in a partial word with one hole.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

Unbordered partial words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Counting Distinct Squares in Partial Words.

[BibT_eX]

[DOI]

Geoffrey Scott

Acta Cybern., 2009

An Answer to a Conjecture on Overlaps in Partial Words Using Periodicity Algorithms.

[BibT_eX]

[DOI]

Abraham Rashin

Elara Willett

Proceedings of the Language and Automata Theory and Applications, 2009

How Many Holes Can an Unbordered Partial Word Contain?.

[BibT_eX]

[DOI]

Emily Allen

Cameron Byrum

Proceedings of the Language and Automata Theory and Applications, 2009

PNEPs, NEPs for Context Free Parsing: Application to Natural Language Processing.

[BibT_eX]

[DOI]

Alfonso Ortega

Emilio del Rosal García

Diana Pérez

María Dolores Jiménez-López

Alexander Perekrestenko

Manuel Alfonseca

Proceedings of the Bio-Inspired Systems: Computational and Ambient Intelligence, 2009

Networks of Evolutionary Processors as Natural Parsers.

[BibT_eX]

Gemma Bel Enguix

Alexander Perekrestenko

Proceedings of the ICAART 2009 - Proceedings of the International Conference on Agents and Artificial Intelligence, Porto, Portugal, January 19, 2009

2007

Freeness of partial words.

[BibT_eX]

[DOI]