Combinatorics on words / by 336459 Lothaire, M.

Interactions between Digital Geometry and Combinatorics on Words by Srečko Brlek

“…We review some recent results in digital geometry obtained by using a combinatorics on words approach to discrete geometry. Motivated on the one hand by the well-known theory of Sturmian words which model conveniently discrete lines in the plane, and on the other hand by the development of digital geometry, this study reveals strong links between the two fields. …”
Get full text

The Join of the Varieties of R-trivial and L-trivial Monoids via Combinatorics on Words by Manfred Kufleitner, Alexander Lauser

Get full text

Combinatorics on words in information security: Unavoidable regularities in the construction of multicollision attacks on iterated hash functions by Juha Kortelainen

“…Classically in combinatorics on words one studies unavoidable regularities that appear in sufficiently long strings of symbols over a fixed size alphabet. …”
Get full text

On an Algorithm for Multiperiodic Words by Štepán Holub

Subjects: Get full text

Search Algorithms for the Combinatorial Generation of Bordered Box Repetition-Free Words by Trienko Grobler, Manfred Habeck, Lynette van Zijl, Jaco Geldenhuys

Subjects: Get full text

Multicollision attacks and generalized iterated hash functions by Kortelainen Juha, Halunen Kimmo, Kortelainen Tuomas

Subjects: Get full text

On the Entropy of a Two Step Random Fibonacci Substitution by Johan Nilsson

Subjects: “…combinatorics on words…”
Get full text

Almost Optimal Searching of Maximal Subrepetitions in a Word by Roman Kolpakov

Subjects: “…combinatorics on words…”
Get full text

More Variations on Shuffle Squares by Jarosław Grytczuk, Bartłomiej Pawlik, Mariusz Pleszczyński

Subjects: “…combinatorics on words…”
Get full text

On the Entropy and Letter Frequencies of Powerfree Words by Manuela Heuer, Uwe Grimm

Subjects: Get full text

Binary Matrixes Based on Pascal’s Triangle’s Arithmetics and Char Sequences by O. Kuzmin, B. Starkov

Subjects: Get full text

Computing Maximal Lyndon Substrings of a String by Frantisek Franek, Michael Liut

Subjects: “…combinatorics on words…”
Get full text

Counting words with Laguerre polynomials by Jair Taylor

Subjects: Get full text

On morphisms preserving infinite Lyndon words by Gwenael Richomme

Subjects: “…combinatorics on words…”
Get full text

How often do we reject a superior value? (Extended abstract) by Kamilla Oliver, Helmut Prodinger

Subjects: Get full text

Generación de curvas fractales a partir de homomorfismos entre lenguajes [con Mathematica R] by José L. Ramírez, Gustavo N. Rubiano

Subjects: Get full text

Connectivity of Fibonacci cubes, Lucas cubes and generalized cubes by Jernej Azarija, Sandi Klavžar, Jaehun Lee, Yoomi Rho

Subjects: Get full text

Analysis of the multiplicity matching parameter in suffix trees by Mark Daniel Ward, Wojciech Szpankowski

Subjects: Get full text

On Correlation Polynomials and Subword Complexity by Irina Gheorghiciuc, Mark Daniel Ward

Subjects: “…combinatorics on words…”
Get full text