Anna E. Frid

Jérémy Scanvic

Proceedings of the Developments in Language Theory - 26th International Conference, 2022

2021

On prefix palindromic length of automatic words.

[BibT_eX]

[DOI]

Enzo Laborde

Jarkko Peltomäki

Theor. Comput. Sci., 2021

2020

Morphic words and equidistributed sequences.

[BibT_eX]

[DOI]

Mélodie Andrieu

Theor. Comput. Sci., 2020

2019

The number of valid factorizations of Fibonacci prefixes.

[BibT_eX]

[DOI]

Pierre Bonardo

Jeffrey O. Shallit

Theor. Comput. Sci., 2019

Prefix Palindromic Length of the Thue-Morse Word.

[BibT_eX]

[DOI]

J. Integer Seq., 2019

First Lower Bounds for Palindromic Length.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 23rd International Conference, 2019

2018

Sturmian numeration systems and decompositions to palindromes.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Equidistributed sequences and pure morphic subshifts.

[BibT_eX]

[DOI]

Mélodie Andrieu

CoRR, 2018

Number of valid decompositions of Fibonacci prefixes.

[BibT_eX]

[DOI]

Pierre Bonardo

CoRR, 2018

2017

Minimal complexity of equidistributed infinite permutations.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

2016

Cost and dimension of words of zero topological entropy.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Words containing all permutations of a family of factors.

[BibT_eX]

[DOI]

CoRR, 2015

Ergodic Infinite Permutations of Minimal Complexity.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 19th International Conference, 2015

Canonical Representatives of Morphic Permutations.

[BibT_eX]

[DOI]

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

2014

The number of binary rotation words.

[BibT_eX]

[DOI]

Damien Jamet

RAIRO Theor. Informatics Appl., 2014

Subword Complexity and Decomposition of the Set of Factors.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

On palindromic factorization of words.

[BibT_eX]

[DOI]

Luca Q. Zamboni

Adv. Appl. Math., 2013

2012

On automatic infinite permutations.

[BibT_eX]

[DOI]

Luca Q. Zamboni

RAIRO Theor. Informatics Appl., 2012

On minimal factorizations of words as products of palindromes

[BibT_eX]

[DOI]

Luca Q. Zamboni

CoRR, 2012

2011

Infinite permutations of lowest maximal pattern complexity.

[BibT_eX]

[DOI]

Teturo Kamae

Pavel Salimov

Theor. Comput. Sci., 2011

On the number of factors in codings of three interval exchange.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2011

Infinite permutations vs. infinite words

[BibT_eX]

[DOI]

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

2009

Simple equations on binary factorial languages.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

2007

On the arithmetical complexity of Sturmian words.

[BibT_eX]

[DOI]

Julien Cassaigne

Theor. Comput. Sci., 2007

On periodicity and low complexity of infinite permutations.

[BibT_eX]

[DOI]

Dmitry Fon-Der-Flaass

Eur. J. Comb., 2007

Commutation of Binary Factorial Languages.

[BibT_eX]

[DOI]

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

2006

On possible growths of arithmetical complexity.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2006

Sequences of low arithmetical complexity.

[BibT_eX]

[DOI]

Julien Cassaigne

RAIRO Theor. Informatics Appl., 2006

Canonical decomposition of catenation of factorial languages

[BibT_eX]

[DOI]

CoRR, 2006

Canonical Decomposition of a Regular Factorial Language.

[BibT_eX]

[DOI]

Proceedings of the Computer Science, 2006

2005

Sequences of linear arithmetical complexity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

A Unique Decomposition Theorem for Factorial Languages.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2005

2003

Arithmetical complexity of symmetric D0L words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

Words Avoiding Abelian Inclusions.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2002

2001

Overlap-free symmetric D0L words.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2001

On factor graphs of DOL words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

On the subword complexity of iteratively generated infinite words.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Arithmetical Complexity of Infinite Words.

[BibT_eX]

Dmitry Fon-Der-Flaass

Proceedings of the International Colloquium on Words, 2000

1999

Applying a uniform marked morphism to a word.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 1999

1998

On the Frequency of Factors in a D0L Word.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1998

On Uniform DOL Words.

[BibT_eX]

[DOI]

Proceedings of the STACS 98, 1998

On Bispecial Words and Subword Complexity of DOL Sequences.

[BibT_eX]

[DOI]

Proceedings of the Sequences and their Applications, 1998

1997

The Subword Complexity of Fixed Points of Binary Uniform Morphisms.

[BibT_eX]

[DOI]