Arturo Carpi

Theor. Comput. Sci., 2021

On the Commutative Equivalence of Algebraic Formal Series and Languages.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2021

2020

Coding by minimal linear grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Repetitions in Toeplitz Words and the Thue Threshold.

[BibT_eX]

[DOI]

Antonio Boccuto

Proceedings of the Beyond the Horizon of Computability, 2020

2019

Locally Strongly Transitive Automata in the Černý Conjecture and Related Problems.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2019

On the length of uncompletable words in unambiguous automata.

[BibT_eX]

[DOI]

Antonio Boccuto

RAIRO Theor. Informatics Appl., 2019

On the Commutative Equivalence of Bounded Semi-linear Codes.

[BibT_eX]

[DOI]

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

2018

On the Commutative Equivalence of Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

2017

On incomplete and synchronizing finite sets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

2014

Universal Lyndon Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Cerny-like problems for finite sets of words.

[BibT_eX]

[DOI]

Proceedings of the 15th Italian Conference on Theoretical Computer Science, 2014

2013

Independent sets of words and the synchronization problem.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2013

2011

Combinatorics on words.

[BibT_eX]

[DOI]

Clelia de Felice

Theor. Comput. Sci., 2011

2010

On factors of synchronized sequences.

[BibT_eX]

[DOI]

Valerio D'Alonzo

Theor. Comput. Sci., 2010

On the Hybrid Cerný-Road Coloring Problem and Hamiltonian Paths.

[BibT_eX]

[DOI]

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

2009

On a word avoiding near repeats.

[BibT_eX]

[DOI]

Valerio D'Alonzo

Inf. Process. Lett., 2009

On the Repetitivity Index of Infinite Words.

[BibT_eX]

[DOI]

Valerio D'Alonzo

Int. J. Algebra Comput., 2009

Strongly transitive automata and the Cerný conjecture.

[BibT_eX]

[DOI]

Acta Informatica, 2009

The Synchronization Problem for Locally Strongly Transitive Automata.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Synchronizing Automata and Independent Systems of Words.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

The Synchronization Problem for Strongly Transitive Automata.

[BibT_eX]

[DOI]

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

2007

On Dejean's conjecture over large alphabets.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Farey codes and languages.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

2006

On the Repetition Threshold for Large Alphabets.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

Codes of central Sturmian words.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Completions in measure of languages and related combinatorial problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Central Sturmian Words: Recent Developments.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 9th International Conference, 2005

2004

Repetitions, Fullness, And Uniformity In Two-Dimensional Words.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2004

Harmonic and gold Sturmian words.

[BibT_eX]

[DOI]

Eur. J. Comb., 2004

Uniform words.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2004

2003

Semiperiodic words and root-conjugacy.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

2002

On the distribution of characteristic parameters of words II.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

On the distribution of characteristic parameters of words.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2002

A combinatorial property of the factor poset of a word.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Words, univalent factors, and boxes.

[BibT_eX]

[DOI]

Stefano Varricchio

Acta Informatica, 2002

2001

Words and special factors.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Special Factors and Uniqueness Conditions in Rational Trees.

[BibT_eX]

[DOI]

Stefano Varricchio

Theory Comput. Syst., 2001

On synchronized sequences and their separators.

[BibT_eX]

[DOI]

Cristiano Maggi

RAIRO Theor. Informatics Appl., 2001

Periodic-like words, periodicity, and boxes.

[BibT_eX]

[DOI]

Acta Informatica, 2001

2000

Special Factors, Periodicity, and an Application to Sturmian Words.

[BibT_eX]

[DOI]

Acta Informatica, 2000

Periodic-Like Words.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2000, 2000

1999

On Abelian Squares and Substitutions.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1999

Special factors in some combinational structures.

[BibT_eX]

[DOI]

Stefano Varricchio

Proceedings of the Developments in Language Theory, 1999

Repetitions and Boxes in Words and Pictures.

[BibT_eX]

Proceedings of the Jewels are Forever, 1999

1998

On the Number of Abelian Square-free Words on Four Letters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

1994

On Repeated Factors in C^\infty-Words.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1994

On Representation Systems.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1994

1993

Overlap-Free Words and Finite Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1993

On Abelian Power-Free Morphisms.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1993

Repetitions in the Kolakovski sequence.

[BibT_eX]

Bull. EATCS, 1993

1990

Non-Repetitive Words Relative to a Rewriting System.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1990

1988

On Synchronizing Unambiguous Automata.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

Multidimensional Unrepetitive Configurations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1988

1987

On Unambiguous Reductions of Monoids of Unambiguous Relations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1987

1986

Square-Free Words on Partially Commutative Free Monoids.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1986

1984

On the Centers of the Set of Weakly Square-Free Words on a Two Letter Alphabet.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1984

1983

On the Size of a Square-Free Morphism on a Three Letter Alphabet.

[BibT_eX]

[DOI]