| On abelian saturated infinite words | 0 | 0.34 | 2019 |
| On k-abelian palindromes. | 0 | 0.34 | 2018 |
| A small minimal aperiodic reversible Turing machine. | 0 | 0.34 | 2017 |
| A Set of Sequences of Complexity 2n+1 2 n + 1. | 0 | 0.34 | 2017 |
| k-Abelian Equivalence and Rationality. | 2 | 0.41 | 2017 |
| Nonhomogeneous Beatty Sequences Leading to Invariant Games. | 0 | 0.34 | 2016 |
| ON THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC NUMBERS: THE HARTMANIS–STEARNS PROBLEM REVISITED | 0 | 0.34 | 2016 |
| COST AND DIMENSION OF WORDS OF ZERO TOPOLOGICAL ENTROPY | 0 | 0.34 | 2016 |
| Abelian Complexity And Frequencies Of Letters In Infinite Words | 0 | 0.34 | 2016 |
| On Growth and Fluctuation of k-Abelian Complexity | 2 | 0.43 | 2015 |
| Tighter Undecidability Bounds for Matrix Mortality, Zero-in-the-Corner Problems, and More. | 3 | 0.39 | 2014 |
| Cyclic Complexity of Words. | 0 | 0.34 | 2014 |
| Invariant games and non-homogeneous Beatty sequences. | 1 | 0.39 | 2013 |
| Which Arnoux-Rauzy Words Are 2-Balanced? | 0 | 0.34 | 2013 |
| On the decidability of semigroup freeness | 9 | 1.04 | 2012 |
| Balance Properties Of Arnoux-Rauzy Words | 3 | 0.71 | 2012 |
| Avoiding Three Consecutive Blocks of the Same Size and Same Sum | 4 | 0.73 | 2011 |
| Combinatorial trees arising in the study of interval exchange transformations | 2 | 0.67 | 2011 |
| Outer billiard outside regular polygons. | 1 | 0.48 | 2011 |
| Avoiding Abelian Powers In Binary Words With Bounded Abelian Complexity | 17 | 1.26 | 2010 |
| Infinite Words And Confluent Rewriting Systems: Endomorphism Extensions | 6 | 1.21 | 2009 |
| Conjugacy of finite biprefix codes | 1 | 0.38 | 2009 |
| On polynomial growth functions of D0L-systems | 0 | 0.34 | 2009 |
| On the Morse-Hedlund complexity gap | 0 | 0.34 | 2009 |
| On the number of alpha-power-free binary words for 2alpha<=7/3 | 5 | 0.63 | 2009 |
| Relationally Periodic Sequences and Subword Complexity | 2 | 0.43 | 2008 |
| On extremal properties of the Fibonacci word | 10 | 0.67 | 2008 |
| Asymptotic behavior of growth functions of D0L-systems | 0 | 0.34 | 2008 |
| Palindrome complexity | 33 | 2.68 | 2003 |
| On the presence of periodic configurations in Turing machines and in counter machines | 14 | 1.34 | 2002 |
| Constructing infinite words of intermediate complexity | 5 | 0.57 | 2002 |
| Recurrence in Infinite Words | 8 | 0.85 | 2001 |
| On Conjugacy of Languages | 5 | 0.67 | 2001 |
| On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations | 0 | 0.34 | 2001 |
| The Chinese Monoid | 4 | 0.92 | 2001 |
| Double sequences with complexity mn+11 | 9 | 0.87 | 1999 |
| Limit values of the recurrence quotient of Sturmian sequences | 10 | 1.18 | 1999 |
| Subword complexity and periodicity in two or more dimensions | 6 | 0.73 | 1999 |
| On The Undecidability Of Freeness Of Matrix Semigroups | 6 | 0.65 | 1999 |
| Words strongly avoiding fractional powers | 4 | 0.82 | 1999 |
| Example of undecidable problems for 2-generator matrix semigroups | 17 | 1.94 | 1998 |
| Toeplitz words, generalized periodicity and periodically iterated morphisms | 17 | 1.97 | 1997 |
| Sequences with grouped factors | 14 | 1.35 | 1997 |
| On a Conjecture of J. Shallit | 4 | 0.55 | 1997 |
| A Class of 1-Additive Sequences and Quadratic Recurrences. | 0 | 0.34 | 1995 |
| Toeplitz Words, Generalized Periodicity and Periodically Iterated Morphisms (Extended Abstract) | 0 | 0.34 | 1995 |
| Special Factors of Sequences With Linear Subword Complexity | 23 | 4.14 | 1995 |
| Unavoidable binary patterns | 16 | 1.87 | 1993 |
| Counting Overlap-Free Binary Words | 18 | 2.04 | 1993 |
| About Gauss codes | 1 | 0.42 | 1992 |
