Luca Q. Zamboni

Adv. Appl. Math., February, 2024

2023

Order Conditions for Languages.

[BibT_eX]

[DOI]

Pascal Hubert

Proceedings of the Combinatorics on Words - 14th International Conference, 2023

2021

On the extremal values of the cyclic continuants of Motzkin and Straus.

[BibT_eX]

[DOI]

CoRR, 2021

Extremal values of semi-regular continuants and codings of interval exchange transformations.

[BibT_eX]

[DOI]

Marcia Edson

CoRR, 2021

Continuants with Equal Values, a Combinatorial Approach.

[BibT_eX]

[DOI]

Gerhard Ramharter

Proceedings of the Combinatorics on Words - 13th International Conference, 2021

2020

Reprint of: ω-Lyndon words.

[BibT_eX]

[DOI]

Mickaël Postic

Theor. Comput. Sci., 2020

ω-Lyndon words.

[BibT_eX]

[DOI]

Mickaël Postic

Theor. Comput. Sci., 2020

2019

Combining Extensions of the Hales-Jewett Theorem with Ramsey Theory in Other Structures.

[BibT_eX]

[DOI]

Neil Hindman

Dona Strauss

Electron. J. Comb., 2019

Open and closed factors in Arnoux-Rauzy words.

[BibT_eX]

[DOI]

Olga G. Parshina

Adv. Appl. Math., 2019

2018

Anti-powers in infinite words.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

2017

Cyclic complexity of words.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2017

A Taxonomy of Morphic Sequences.

[BibT_eX]

[DOI]

CoRR, 2017

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.

[BibT_eX]

[DOI]

Aleksi Saarela

Acta Cybern., 2017

The sequence of open and closed prefixes of a Sturmian word.

[BibT_eX]

[DOI]

Gabriele Fici

Adv. Appl. Math., 2017

2016

On some variations of coloring problems of infinite words.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2016

On prefixal factorizations of words.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Abelian bordered factors and periodicity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Cost and dimension of words of zero topological entropy.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Words 2013.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

On generating binary words palindromically.

[BibT_eX]

[DOI]

Tero Harju

Mari Huova

J. Comb. Theory A, 2015

2014

A coloring problem for infinite words.

[BibT_eX]

[DOI]

Elena V. Pribavkina

J. Comb. Theory A, 2014

Infinite self-shuffling words.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

Extremal words in morphic subshifts.

[BibT_eX]

[DOI]

Discret. Math., 2014

Subword Complexity and Decomposition of the Set of Factors.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence.

[BibT_eX]

[DOI]

Aleksi Saarela

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

On the least number of palindromes contained in an infinite word.

[BibT_eX]

[DOI]

Gabriele Fici

Theor. Comput. Sci., 2013

Reversible Christoffel factorizations.

[BibT_eX]

[DOI]

Michelangelo Bucci

Theor. Comput. Sci., 2013

Abelian returns in Sturmian words.

[BibT_eX]

[DOI]

Svetlana Puzynina

J. Comb. Theory A, 2013

On a generalization of Abelian equivalence and complexity of infinite words.

[BibT_eX]

[DOI]

Aleksi Saarela

J. Comb. Theory A, 2013

On additive properties of sets defined by the Thue-Morse word.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

On palindromic factorization of words.

[BibT_eX]

[DOI]

Anna E. Frid

Svetlana Puzynina

Adv. Appl. Math., 2013

Self-shuffling Words.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

A Coloring Problem for Sturmian and Episturmian Words.

[BibT_eX]

[DOI]

Elena V. Pribavkina

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

2012

On automatic infinite permutations.

[BibT_eX]

[DOI]

Anna E. Frid

RAIRO Theor. Informatics Appl., 2012

Some Characterizations of Sturmian Words in Terms of the Lexicographic Order.

[BibT_eX]

[DOI]

Michelangelo Bucci

Fundam. Informaticae, 2012

On minimal factorizations of words as products of palindromes

[BibT_eX]

[DOI]

Anna E. Frid

Svetlana Puzynina

CoRR, 2012

2011

Abelian complexity of minimal subshifts.

[BibT_eX]

[DOI]

Gwénaël Richomme

Kalle Saari

J. Lond. Math. Soc., 2011

Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity.

[BibT_eX]

[DOI]

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

Combinatorial trees arising in the study of interval exchange transformations.

[BibT_eX]

[DOI]

Julien Cassaigne

Eur. J. Comb., 2011

2010

On graphs of central episturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Standard factors of Sturmian words.

[BibT_eX]

[DOI]

Gwénaël Richomme

Kalle Saari

RAIRO Theor. Informatics Appl., 2010

Involutions of epicentral words.

[BibT_eX]

[DOI]

Eur. J. Comb., 2010

Balance and Abelian complexity of the Tribonacci word.

[BibT_eX]

[DOI]

Gwénaël Richomme

Kalle Saari

Adv. Appl. Math., 2010

2009

Fine and Wilf words for any periods II.

[BibT_eX]

[DOI]

Robert Tijdeman

Theor. Comput. Sci., 2009

A new characteristic property of rich words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Palindromic richness.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On theta-episturmian words.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

A connection between palindromic and factor complexity using return words.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2009

2008

Rich, Sturmian, and trapezoidal words.

[BibT_eX]

[DOI]

Amy Glen

Theor. Comput. Sci., 2008

On different generalizations of episturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

On some problems related to palindrome closure.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2008

Relationally Periodic Sequences and Subword Complexity.

[BibT_eX]

[DOI]

Julien Cassaigne

Tomi Kärki

Proceedings of the Developments in Language Theory, 12th International Conference, 2008

2007

Suffix Automata and Standard Sturmian Words.

[BibT_eX]

[DOI]

Marinella Sciortino

Proceedings of the Developments in Language Theory, 11th International Conference, 2007

2004

Periodicity and local complexity.

[BibT_eX]

[DOI]

Anthony Quas

Theor. Comput. Sci., 2004

Characterisations of balanced words via orderings.

[BibT_eX]

[DOI]

Oliver Jenkinson

Theor. Comput. Sci., 2004

On representations of positive integers in the Fibonacci base.

[BibT_eX]

[DOI]

Marcia Edson

Theor. Comput. Sci., 2004

2002

A Note on a Conjecture of Duval and Sturmian Words.

[BibT_eX]

[DOI]

Filippo Mignosi

RAIRO Theor. Informatics Appl., 2002

2001

Combinatorics of Three-Interval Exchanges.

[BibT_eX]

[DOI]

Charles Holton

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

1999

Descendants of Primitive Substitutions.

[BibT_eX]

[DOI]

Charles Holton