Arseny M. Shur

Stefan Zorcic

J. Comb. Theory, Ser. A, 2024

Distance Labeling for Families of Cycles.

[BibT_eX]

[DOI]

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

String 2-Covers with No Length Restrictions.

[BibT_eX]

[DOI]

Itai Boneh

Shay Golan

Proceedings of the 32nd Annual European Symposium on Algorithms, 2024

Searching 2D-Strings for Matching Frames.

[BibT_eX]

[DOI]

Proceedings of the 35th Annual Symposium on Combinatorial Pattern Matching, 2024

2023

New constructions for 3-free and 3+-free binary morphisms.

[BibT_eX]

[DOI]

Stefan Zorcic

CoRR, 2023

Approaching Repetition Thresholds via Local Resampling and Entropy Compression.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 27th International Conference, 2023

2022

On minimal critical exponent of balanced sequences.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2022

Computing The Maximum Exponent in a Stream.

[BibT_eX]

[DOI]

Oleg Merkurev

Algorithmica, 2022

Abelian Repetition Threshold Revisited.

[BibT_eX]

[DOI]

Proceedings of the Computer Science - Theory and Applications, 2022

2021

Transition Property for Cube-Free Words.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2021

Words Separation and Positive Identities in Symmetric Groups.

[BibT_eX]

[DOI]

Olga Karpova

J. Autom. Lang. Comb., 2021

Branching Densities of Cube-Free and Square-Free Words.

[BibT_eX]

[DOI]

Algorithms, 2021

Branching Frequency and Markov Entropy of Repetition-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020

String periods in the order-preserving model.

[BibT_eX]

[DOI]

Inf. Comput., 2020

Palindromic k-Factorization in Pure Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2019

Subword complexity and power avoidance.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Comparison of LZ77-type parsings.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Tight Tradeoffs for Real-Time Approximation of Longest Palindromes in Streams.

[BibT_eX]

[DOI]

Algorithmica, 2019

Searching Runs in Streams.

[BibT_eX]

[DOI]

Oleg Merkurev

Proceedings of the String Processing and Information Retrieval, 2019

Searching Long Repeats in Streams.

[BibT_eX]

[DOI]

Oleg Merkurev

Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018

Square-Free Partial Words with Many Wildcards.

[BibT_eX]

[DOI]

Daniil Gasnikov

Int. J. Found. Comput. Sci., 2018

EERTREE: An efficient data structure for processing palindromes in strings.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

2017

Lower Bounds on Words Separation: Are There Short Identities in Transformation Semigroups?

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the Size of Lempel-Ziv and Lyndon Factorizations.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Counting Palindromes in Substrings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2017

On the Tree of Binary Cube-Free Words.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 21st International Conference, 2017

Palindromic Length in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

More on quantum, stochastic, and pseudo stochastic languages with few states.

[BibT_eX]

[DOI]

Abuzer Yakaryilmaz

Nat. Comput., 2016

Palindromic rich words and run-length encodings.

[BibT_eX]

[DOI]

Chuan Guo

Inf. Process. Lett., 2016

Preface.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2016

The Number of Distinct Subpalindromes in Random Words.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2016

Ternary Square-Free Partial Words with Many Wildcards.

[BibT_eX]

[DOI]

Daniil Gasnikov

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Generating square-free words efficiently.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Searching for Zimin patterns.

[BibT_eX]

[DOI]

Wojciech Rytter

Theor. Comput. Sci., 2015

Optimal Bounds for the Similarity Density of the Thue-Morse Word with Overlap-Free and 73-Power-Free Infinite Binary Words.

[BibT_eX]

[DOI]

Chen Fei Du

Int. J. Found. Comput. Sci., 2015

On the Combinatorics of Palindromes and Antipalindromes.

[BibT_eX]

[DOI]

Chuan Guo

CoRR, 2015

Pal k is Linear Recognizable Online.

[BibT_eX]

[DOI]

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

On the Tree of Ternary Square-Free Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 10th International Conference, 2015

2014

Growth of Power-Free Languages over Large Alphabets.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

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

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2014

Languages with a Finite antidictionary: some growth Questions.

[BibT_eX]

[DOI]

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

Periodic Partial Words and Random Bipartite Graphs.

[BibT_eX]

[DOI]

Lidia A. Idiatulina

Fundam. Informaticae, 2014

$\mathrm{Pal}^k$ Is Linear Recognizable Online.

[BibT_eX]

[DOI]

CoRR, 2014

Quantum, Stochastic, and Pseudo Stochastic Languages with Few States.

[BibT_eX]

[DOI]

Abuzer Yakaryilmaz

Proceedings of the Unconventional Computation and Natural Computation, 2014

2013

Finding Distinct Subpalindromes Online.

[BibT_eX]

[DOI]

Proceedings of the Prague Stringology Conference 2013, Prague, Czech Republic, 2013

Languages with a Finite Antidictionary: Growth-Preserving Transformations and Available Orders of Growth.

[BibT_eX]

[DOI]

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

2012

On Abelian repetition threshold.

[BibT_eX]

[DOI]

Alexey V. Samsonov

RAIRO Theor. Informatics Appl., 2012

Constructing Premaximal Binary Cube-Free Words of any Level.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

On Pansiot Words Avoiding 3-Repetitions.

[BibT_eX]

[DOI]

Irina A. Gorbunova

Int. J. Found. Comput. Sci., 2012

Growth properties of power-free languages.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2012

On Two Stronger Versions of Dejean's Conjecture.

[BibT_eX]

[DOI]

Igor N. Tunev

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

Constructing Premaximal Ternary Square-Free Words of Any Level.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

On the existence of Minimal β-powers.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Almost Overlap-Free Words and the Word Problem for the Free Burnside Semigroup Satisfying X2 = X3.

[BibT_eX]

[DOI]

Andrey N. Plyushchenko

Int. J. Algebra Comput., 2011

Fife's Theorem for (7/3)-Powers

[BibT_eX]

[DOI]

Narad Rampersad

Proceedings of the Proceedings 8th International Conference Words 2011, 2011

On Brzozowski's Conjecture for the Free Burnside Semigroup Satisfying x2 = x3.

[BibT_eX]

[DOI]

Andrey N. Plyushchenko

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Two Combinatorial Criteria for BWT Images.

[BibT_eX]

[DOI]

Konstantin M. Likhomanov

Proceedings of the Computer Science - Theory and Applications, 2011

2010

Growth rates of complexity of power-free languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

On the growth rates of complexity of threshold languages.

[BibT_eX]

[DOI]

Irina A. Gorbunova

RAIRO Theor. Informatics Appl., 2010

Combinatorial Characterization of Formal Languages

[BibT_eX]

[DOI]

CoRR, 2010

Numerical values of the growth rates of power-free languages

[BibT_eX]

[DOI]

CoRR, 2010

On Ternary Square-free Circular Words.

[BibT_eX]

[DOI]

Electron. J. Comb., 2010

On the Existence of Minimal beta-Powers.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Polynomial languages with finite antidictionaries.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2009

On intermediate factorial languages.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Two-Sided Bounds for the Growth Rates of Power-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008

Comparing Complexity Functions of a Language and Its Extendable Part.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Combinatorial Complexity of Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2008

2007

Rational Approximations of Polynomial Factorial Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

2006

Factorial Languages of Low Combinatorial Complexity.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 10th International Conference, 2006

2001

On the Periods of Partial Words.

[BibT_eX]

[DOI]

Yulia V. Konovalova

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

1996

Overlap-Free Words and Thue-Morse Sequences.

[BibT_eX]

[DOI]