Alessandro De Luca

Theor. Comput. Sci., 2022

Some Results on Digital Segments and Balanced Words.

[BibT_eX]

[DOI]

CoRR, 2022

Maximal Closed Substrings.

[BibT_eX]

[DOI]

Proceedings of the String Processing and Information Retrieval, 2022

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

2019

Characteristic Parameters and Special Trapezoidal Words.

[BibT_eX]

[DOI]

Alma D'Aniello

Proceedings of the Combinatorics on Words - 12th International Conference, 2019

Textual Processing in Social Network Analysis.

[BibT_eX]

[DOI]

Proceedings of the Web, Artificial Intelligence and Network Applications, 2019

2017

On Christoffel and standard words and their derivatives.

[BibT_eX]

[DOI]

Alma D'Aniello

Theor. Comput. Sci., 2017

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

[BibT_eX]

[DOI]

Adv. Appl. Math., 2017

2016

Aperiodic pseudorandom number generators based on infinite words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2015

Sturmian words and the Stern sequence.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

2013

Reversible Christoffel factorizations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Enumeration and structure of trapezoidal words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2013

Infinite Words with Well Distributed Occurrences.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

Open and Closed Prefixes of Sturmian Words.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

A generalized palindromization map in free monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

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

[BibT_eX]

[DOI]

Fundam. Informaticae, 2012

2011

Christoffel Words and the Calkin-Wilf Tree.

[BibT_eX]

[DOI]

Christophe Reutenauer

Electron. J. Comb., 2011

2010

On the number of episturmian palindromes.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

2009

Characteristic morphisms of generalized episturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

A new characteristic property of rich words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

On a Family of Morphic Images of Arnoux-Rauzy Words.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

Rich and Periodic-Like Words.

[BibT_eX]

[DOI]

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

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

On a Generalization of Standard Episturmian Morphisms.

[BibT_eX]

[DOI]

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

2006

Some characterizations of finite Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Pseudopalindrome closure operators in free monoids.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Combinatorial Properties of Sturmian Palindromes.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

2005

Palindromes in Sturmian Words.

[BibT_eX]

[DOI]